ConceptTheory & Algos
Arthur-Merlin (AM) and Merlin-Arthur (MA) classes
Complexity classes that generalize NP by incorporating public (AM) or private (MA) randomness into interactive proofs between an all-powerful prover (Merlin) and a randomized verifier (Arthur).
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.