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

Course Info

Instructor

Prof. Dor Minzer

Departments

Mathematics

As Taught In

Fall 2022

Level

Graduate

Topics

Learning Resource Types

Lecture Notes

Problem Sets

Download Course

Problem Sets

18.408 F2022 Problem Set 1

18.408 F2022 Problem Set 2

18.408 F2022 Problem Set 3

18.408 F2022 Problem Set 4

18.408 F2022 Problem Set 5

Course Info

Instructor

Prof. Dor Minzer

Departments

Mathematics

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