
BPP collapses to P in the presence of powerful circuit lower bounds. (Image by MIT OpenCourseWare.)
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.
Instructors: | |
Course Number: |
|
Departments: | |
Topics: | |
As Taught In: | Spring 2016 |
Level: |
Graduate
|
Learning Resource Types
notes
Lecture Notes
assignment
Problem Sets
group_work
Projects with Examples