18.408 | Fall 2022 | Graduate

Topics in Theoretical Computer Science: Probabilistically Checkable Proofs

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

Resource Type:
Lecture Notes
pdf
498 kB
18.408 F2022 Lectures 17–20: The Long-code Paradigm and Some Optimal Inapproximability Results
Download File

Course Info

Instructor

Departments

As Taught In

Fall 2022

Level

Graduate

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