Sign inSign in

Arthur-Merlin (AM) and Merlin-Arthur (MA) classes

Complexity classes that generalize NP by incorporating public (AM) or private (MA) randomness into interactive proofs between an all-powerful prover (Merlin) and a randomized verifier (Arthur).
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.

Lecturers

1

    Connections

    4

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

    Concepts3

    Lecture1

    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.