- Schedule of Classes - February 16, 2020 7:14PM EST
- Course Catalog - February 16, 2020 7:15PM EST
Course information provided by the Courses of Study 2019-2020.
Explores the power and limitations of efficient computation. Understanding how the notion of efficient computation changes with respect to resources such as time, space, randomness, advice, and interaction. Concrete computational models that we will study will include Turing machines, Boolean circuits, Decision trees, and Branching Programs. Advanced topics may include error-correcting codes, probabilistic checkable proofs, and circuit lower bounds.
When Offered Spring.
Prerequisites/Corequisites Prerequisite: CS 4820.
Regular Academic Session.
Credits and Grading Basis
3 Credits Stdnt Opt(Letter or S/U grades)
Class Number & Section Details
- TRHollister Hall B14
Or send this URL: