ConceptTheory & Algos
IP = PSPACE
The theorem that the class of languages with efficient interactive proof systems is equal to the class of problems solvable in polynomial space.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.