ConceptTheory & Algos
Arthur-Merlin (AM) hierarchy
The class of languages accepted by interactive proof systems where Arthur and Merlin take turns sending messages, which collapses to AM for any fixed number of rounds .
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.