Skip to content
lectern.tv
CMU 15-855: Graduate Computational Complexity Theory →0/18
1

Lecture 1: Course Introduction and Overview (15-855)

1:20:23
2

Lecture 2: Hierarchy Theorems (Time, Space, and Nondeterministic) (15-855)

1:21:06
3

Lecture 3: Hopcroft--Paul--Valiant Theorem (15-855)

1:20:29
4

Lecture 4: Circuits (15-855)

1:19:50
5

Lecture 5: Probabilistic Complexity Classes (15-855)

1:20:55
6

Lecture 6: Quasilinear Cook--Levin Theorem (15-855)

1:17:49
7

Lecture 7: The Polynomial Time Hierarchy (15-855)

1:19:11
8

Lecture 8: Oracles, and the Polynomial Time Hierarchy vs. circuits (15-855)

1:22:04
9

Lecture 9: Time/Space Tradeoffs for SAT (15-855)

1:31:30
10

Lecture 10: Introduction to Arthur-Merlin classes, MA and AM (15-855)

1:22:37
11

Lecture 11: More on constant-round interactive proof systems (15-855)

1:21:18
12

Lecture 12: Approximate counting (15-855)

1:19:48
13

Lecture 13: Valiant--Vazirani Theorem, and Exact Counting (#P) (15-855)

1:16:15
14

Lecture 14: Toda's 1st Theorem and the Permanent (15-855)

1:18:15
15

Lecture 20: Permanent is #P-complete (15-855)

1:13:35
16

Lecture 15: Algebraic Circuit Complexity (15-855)

1:20:29
17

Lecture 16: Instance Checking and the Permanent (15-855)

1:20:19
18

Lecture 17: IP = PSPACE (15-855)

1:18:47

Lecture 17: IP = PSPACE (15-855)

Ryan O'DonnellCarnegie Mellon University

Professor

1:18:47·2017·graduate level

Demonstrates the seminal result that the class of languages with Interactive Proof systems (IP) is precisely equivalent to Polynomial Space (PSPACE).

Theory & AlgosComputational ComplexityIP=PSPACEInteractive ProofsComplexity Class Equivalence

Graduate Computational Complexity Theory

Lecture 17: IP = PSPACE

Carnegie Mellon Course 15-855, Fall 2017

Previous · Lecture 17

Lecture 16: Instance Checking and the Permanent (15-855)

Seminar notes & discussion

Sign in to comment

No public seminar notes on this lecture yet.