Dinur's Proof of the PCP Theorem: outline || @ CMU || Lecture 27b of CS Theory Toolkit
An outline of Dinur's iterative proof of the PCP Theorem by "gap amplification". Lecture 27b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resource for this lecture:
Course on "The PCP Theorem and Hardness of Approximation" by O'Donnell and Guruswami, https://courses.cs.washington.edu/cou...
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)