Sign inSign in

Merlin-Arthur

MA is a complexity class that extends NP by allowing the verifier to use randomized polynomial-time algorithms with bounded error.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 definitions
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.

NP3BPP2Complexity classes2Interactive proof system1Polynomial-time verification1Quantum/randomized complexity1Randomized algorithm1Randomized complexity classes1

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 58:34Course Introduction and Overview
    • 2:10More on constant-round interactive proof systems

Connections

6

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

Concepts3

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.