ConceptTheory & Algos
Constant-round interactive proofs (Merlin-Arthur proofs)
Interactive proof systems between an all-powerful prover (Merlin) and a randomized polynomial-time verifier (Arthur) that use a constant number of rounds and public coins.
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.