Sign inSign in

Constant-round interactive proofs (Merlin-Arthur proofs)

Interactive proof systems between an all-powerful prover (Merlin) and a randomized polynomial-time verifier (Arthur) that use a constant number of rounds and public coins.
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.

Complexity theory1Interactive proofs1Randomized complexity classes (MA, AM)1

Lecturers

1

    Connections

    3

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

    Concepts2

    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.