Advanced Complexity Theory

A collapsing wall and with writing over it.

BPP collapses to P in the presence of powerful circuit lower bounds. (Image by MIT OpenCourseWare.)


MIT Course Number

18.405J / 6.841J

As Taught In

Spring 2016



Cite This Course

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.

Other Versions

Other OCW Versions

Archived versions: Question_avt logo

Related Content

Dana Moshkovitz, and Mohammad Bavarian. 18.405J Advanced Complexity Theory. Spring 2016. Massachusetts Institute of Technology: MIT OpenCourseWare, License: Creative Commons BY-NC-SA.

For more information about using these materials and the Creative Commons license, see our Terms of Use.