Sign inSign in

Probabilistically checkable proof of proximity

A system where a string has an r-query length l PCPP system with a rejection rate lambda if a string tester can query the input and a proof to test properties.
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.

Query complexity1String testing algorithms1

Lecturers

1

    Connections

    2

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

    Concept1

    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.