Resources
This page will be updated throughout the semester with new resources as I find them. If you have found a particularly useful resource, feel free to let me know and I will gladly add them to the resources below.
Lecture Notes
- Lecture 1
- Lecture 2
- Lecture 3
- Lecture 4
- Lecture 5
- Lecture 6
- Lecture 7
- Lecture 8
- Lecture 9
- Lecture 10
- Lecture 11
- Lecture 12
- Lecture 13
- Lecture 14
- Lecture 15
- Lecture 16
- Lecture 17
- Lecture 18
- Lecture 19
- Lecture 20
- Lecture 21
- Lecture 22
- Lecture 23
- Lecture 24
- Crypto and Complexity Theory
Books
- Computational Complexity: A Modern Approach (Draft) by Sanjeev Arora and Boaz Barak
- Introduction to the Theory of Computation1 by Michael Sipser
- Proofs, Arguments, and Zero-knowledge by Justin Thaler
- Mathematics and Computation by Avi Widgerson
Other Lecture Notes and Videos
- Michael Sipser’s Theory of Computation Course at MIT
PCP Theorem
- Notes from Jon Katz: first lecture and second lecture. All his other notes from this course: website.
- Dana Moshkovitz’s Tale of the PCP Theorem.
- Irit Dinur’s alternative proof of the PCP Theorem: The PCP Theorem by Gap Amplification.
- PCP Theorem Course by Irit Dinur and Dana Moshkovitz: Probabilistically Checkable Proofs.
-
You may be able to find the book online for free. I cannot confirm or deny the availability. Supplemental readings may be given from this book and will be paired with the appropriate video lecture from Michael Sipser’s course below. ↩