ConceptTheory & Algos
Merlin-Arthur
MA is a complexity class that extends NP by allowing the verifier to use randomized polynomial-time algorithms with bounded error.
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.
NP3BPP2Complexity classes2Interactive proof system1Polynomial-time verification1Quantum/randomized complexity1Randomized algorithm1Randomized complexity classes1
Lecturers
1Ryan O'Donnell
Connections
6The lectures that define it or assume it, and the concepts next to it.