Topics in Theoretical Computer Science: Probabilistically Checkable Proofs | Mathematics | MIT OpenCourseWare

Lecture Notes

18.408 F2022 Lecture 1: Introduction

18.408 F2022 Lecture 12: Aggregation of Queries

18.408 F2022 Lecture 13: Hardness of Approximating the Maximum Clique

18.408 F2022 Lecture 16: The Set-cover Problem and A Reduction from Label-cover to Set-cover

18.408 F2022 Lecture 21: The Unique-Games Conjecture and the Goemans-Williamson Algorithm

18.408 F2022 Lecture 9: A PCP with polylog Many Queries and Formalizations of PCPs

18.408 F2022 Lectures 10–11: Hadamard and Quadratic Hadamard Codes; The Composition Technique

18.408 F2022 Lectures 14–15: The Parallel Repetition Theorem

18.408 F2022 Lectures 17–20: The Long-code Paradigm and Some Optimal Inapproximability Results

18.408 F2022 Lectures 2–3: Error Correcting Codes

18.408 F2022 Lectures 22–23: Unique-Games Hardness of Max-cut

18.408 F2022 Lectures 4–6: Quadratic Solvability, Low-degree Extensions and the Sum-check Protocol

18.408 F2022 Lectures 7–8: Low Degree Testing

Course Info

Instructor

Prof. Dor Minzer

Departments

Mathematics

As Taught In

Fall 2022

Level

Graduate

Course Info

Instructor

Prof. Dor Minzer

Departments

Mathematics

As Taught In

Fall 2022

Level

Graduate

Topics

Topics

Learning Resource Types

Lecture Notes

Problem Sets

Download Course

MIT Open Learning

Over 2,500 courses & materials

Freely sharing knowledge with learners and educators around the world. Learn more

© 2001–2026 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2026 Massachusetts Institute of Technology