Sign inSign in

Verifier

A computational process that checks the validity of a certificate, operating with limited (logarithmic) space.
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.

Turing machine2Certificate1Complexity classes1Language1Log space1Polynomial time complexity1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 31:10The Complexity Class NP

Lectures that assume it

5

Connections

15

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.