ConceptTheory & Algos
Arthur-Merlin
AM is a complexity class where Arthur (the randomized verifier) sends random coin flips first, and Merlin responds with a proof.
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
1Ryan O'Donnell
Connections
3The lectures that define it or assume it, and the concepts next to it.