CS 4814 - Introduction to Computational Complexity

Fall. 3 credits. Student option grading.

Prerequisite: CS 4820. Co-meets with CS 5814.

E. Chattopadhyay.

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.