ConceptTheory & Algos
AM protocol
An interactive proof system between an Arthur (randomized polynomial-time verifier) and Merlin (all-powerful prover) where Arthur sends random coins and Merlin responds with a message.
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.
Complexity classes1Interactive proofs1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.