Sign inSign in

Probabilistically checkable proofs

A type of proof system where a reviewer can verify a proof with high confidence by spot-checking only a constant number of symbols randomly.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Avi Wigderson

    Institute for Advanced Study · Undergraduate

    A proof system where a non-interactive proof can be verified probabilistically by reading only a constant number of bits from the proof string.
    • 45:00Mathematics and Computation: The Landscape of P vs. NP
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 1:10:50Probability Densities and BLR Linearity Testing

Lectures that assume it

3

Connections

14

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

2 lecturers. 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.