Sign inSign in

Arthur-Merlin

AM is a complexity class where Arthur (the randomized verifier) sends random coin flips first, and Merlin responds with a proof.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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.

MA2Interactive proofs1MA complexity class1Quantifiers in complexity1Randomized reductions1SAT1

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 4:24More on constant-round interactive proof systems

Connections

3

The lectures that define it or assume it, and the concepts next to it.

Concept1

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.