ConceptTheory & Algos
Constant-round interactive proofs
Interactive proofs where the interaction between the prover and the verifier is restricted to a constant number of message exchanges.
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.