Photo Gallery

Undergrad Complexity at CMU - Lecture 8: NP
Undergrad Complexity at CMU - Lecture 1: Course Overview
Undergrad Complexity at CMU - Lecture 15: coNP
Undergrad Complexity at CMU - Lecture 9: Nondeterminism
Undergrad Complexity at CMU - Lecture 24: Oracle Turing Machines and P^NP
Undergrad Complexity at CMU - Lecture 18: NL-Completeness and Logspace Reductions
Ironic complexity: Graduate Complexity Lecture 27 at CMU
Undergrad Complexity at CMU - Lecture 23: The Polynomial Hierarchy
IP = PSPACE: Graduate Complexity Lecture 17 at CMU
Undergrad Complexity at CMU - Lecture 7: SAT
Undergrad Complexity at CMU - Lecture 10: Reductions
Undergrad Complexity at CMU - Lecture 21: Randomized Complexity: RP, coRP, and ZPP