CST 412 SEM IN THEORY OF COMPUTATION
Recent developments in foundations of computing, new computing paradigms and applications, analysis of algorithms for emerging areas of computer science. Examples of course topics include algorithms for social networking, algorithms of computer learning, computational economics, new CS paradigms of measure and conquer, inclusion/exclusion, and sieve design. The course has a seminar format: students will be asked to read, analyze and present papers.
There are no prerequisites listed for this course.
CST 280 with a min grade of C- required.