18.405J | Spring 2016 | Graduate

Advanced Complexity Theory

Course Description

This graduate-level course focuses on current research topics in computational complexity theory. Topics include: Nondeterministic, alternating, probabilistic, and parallel computation models; Boolean circuits; Complexity classes and complete sets; The polynomial-time hierarchy; Interactive proof systems; …
This graduate-level course focuses on current research topics in computational complexity theory. Topics include: Nondeterministic, alternating, probabilistic, and parallel computation models; Boolean circuits; Complexity classes and complete sets; The polynomial-time hierarchy; Interactive proof systems; Relativization; Definitions of randomness; Pseudo-randomness and derandomizations;Interactive proof systems and probabilistically checkable proofs.
Learning Resource Types
Lecture Notes
Problem Sets
Projects with Examples
A collapsing wall and with writing over it.
BPP collapses to P in the presence of powerful circuit lower bounds. (Image by MIT OpenCourseWare.)