BPP collapses to P in the presence of powerful circuit lower bounds. (Image by MIT OpenCourseWare.)
Instructor(s)
Prof. Dana Moshkovitz
Mohammad Bavarian
MIT Course Number
18.405J / 6.841J
As Taught In
Spring 2016
Level
Graduate
Course Description
Course Features
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; Relativization; Definitions of randomness; Pseudo-randomness and derandomizations;Interactive proof systems and probabilistically checkable proofs.
