- Schedule of Classes - January 19, 2016 6:14PM EST
- Course Catalog - January 19, 2016 6:21PM EST
Course information provided by the Courses of Study 2015-2016.
Explores the power and limitations of efficient algorithms. Compares basic models of computations such as finite automata, Boolean circuits, and Turing machines. Illustrates the notion of computational intractability through the concept NP-completeness and the computational foundations of modern cryptography. Investigates the role of randomness and approximation in the modern theory of computing.
When Offered Fall.
Prerequisites/Corequisites Prerequisite: CS 4820.
Regular Academic Session.
Credits and Grading Basis
3 Credits Stdnt Opt(Student Option)
Class Number & Section Details
- TR Hollister Hall 306
Disabled for this roster.