Sign inSign in

AM

Arthur-Merlin complexity class, representing languages that have interactive proof systems with 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 classes1Interactive proofs1Quantifier1Randomized complexity classes1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 1:20:25Introduction to Arthur-Merlin classes, MA and AM

Lectures that assume it

1

Connections

8

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

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.