18.408Math
Topics in Theoretical Computer Science: Probabilistically Checkable Proofs
Prof. Dor Minzer · Fall 2022 · Graduate
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…
Original on MIT OpenCourseWareStudent age
10years · 5th grade
Lectures
Looking up lectures on MIT OpenCourseWare…