ConceptTheory & Algos
MAM
A complexity class representing languages decided by Arthur-Merlin-Arthur protocols with polynomial-size message lengths.
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.
Arthur-Merlin games1Polynomial time verifier1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.