Probabilistic Complexity Classes: Graduate Complexity Lecture 5 at CMU
Graduate
Oracles, and the Polynomial Time Hierarchy vs. circuits: Graduate Complexity Lecture 8 at CMU
Graduate
Instance Checking and the Permanent: Graduate Complexity Lecture 16 at CMU
Graduate
Circuits: Graduate Complexity Lecture 4 at CMU
Graduate
Undergrad Complexity at CMU - Lecture 15: coNP
Undergraduate Computational
Algebraic Circuit Complexity: Graduate Complexity Lecture 15 at CMU
Graduate
The Switching Lemma: PRST version: Graduate Complexity Lecture 19 at CMU
Graduate
Undergrad Complexity at CMU - Lecture 22: BPP
Undergraduate Computational
4a. Probabilistic Queries and their Complexity (Chapter 5)
Adnan Darwiche's UCLA
Undergrad Complexity at CMU - Lecture 6: Problems in P
Undergraduate Computational
Ironic complexity: Graduate Complexity Lecture 27 at CMU
Graduate
Quasilinear Cook--Levin Theorem: Graduate Complexity Lecture 6 at CMU
Graduate
Valiant--Vazirani Theorem, and Exact Counting (#P): Graduate Complexity Lecture 13 at CMU
Graduate
Permanent is #P-complete: Graduate Complexity Lecture 20 (out of order) at CMU
Graduate
Undergrad Complexity at CMU - Lecture 27: Hardness within P
Undergraduate Computational
Random Restrictions and AC0 Circuit Lower Bounds: Graduate Complexity Lecture 18 at CMU
Graduate
Undergrad Complexity at CMU - Lecture 21: Randomized Complexity: RP, coRP, and ZPP
Undergraduate Computational
