ConceptTheory & Algos
AM (Arthur-Merlin) complexity class characterization
A characterization of AM protocols as analogous to NP with a probabilistic quantifier (for most) at the front.
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.
AM class1Quantifier1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.