ConceptTheory & Algos
Interactive proof systems collapse
The theorem stating that constant-round interactive proof systems can be compressed down to two rounds.
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
3The lectures that define it or assume it, and the concepts next to it.