Open Course Space

Topics in Theoretical Computer Science: Probabilistically Checkable Proofs

Massachusetts Institute of TechnologyUnited States18.408
Free, no sign-up neededFall 2022English
Go to course on MIT OpenCourseWare

In this course, we will present the theory of Probabilistically Checkable Proofs (PCPs), and prove some fundamental consequences of it as well as more recent advances. More specifically, the first half of the course will be devoted to the (algebraic) proof of the basic PCP Theorem and basic relation to approximation problems.

Description from MIT OpenCourseWare.

Where to take this course