graduate complexity

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶Toda's 1st Theorem and the Permanent: Graduate Complexity Lecture 14 at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
2. 2▶Valiant--Vazirani Theorem, and Exact Counting (#P): Graduate Complexity Lecture 13 at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
3. 3▶Approximate counting: Graduate Complexity Lecture 12 at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
4. 4▶More on constant-round interactive proof systems: Graduate Complexity Lecture 12 at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
5. 5▶Introduction to Arthur-Merlin classes, MA and AM: Graduate Complexity Lecture 10 at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
6. 6▶Time/Space Tradeoffs for SAT: Graduate Complexity Lecture 9 at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
7. 7▶Improving Kannan's Theorem: Graduate Complexity Lecture 8 bonus material at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
8. 8▶Oracles, and the Polynomial Time Hierarchy vs. circuits: Graduate Complexity Lecture 8 at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
9. 9▶The Polynomial Time Hierarchy: Graduate Complexity Lecture 7 at CMUGraduate Complexity Theory at CMUNotes
   +Watch later
10. 10▶Quasilinear Cook--Levin Theorem: Graduate Complexity Lecture 6 at CMUGraduate Complexity Theory at CMUNotes
    +Watch later