Sign inSign in

Zero-error probabilistic polynomial time

ZPP is the complexity class of problems solvable by a probabilistic Turing machine in expected polynomial time with zero error.
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.

coRP2RP2Complexity classes1Expected polynomial time1

Lecturers

2

Each in their own terms, from the easiest level.

  • Venkatesan Guruswami

    Carnegie Mellon University · Undergraduate

    The complexity class of problems solvable by a probabilistic Turing machine in expected polynomial time with zero error, equivalent to RP intersect coRP.
    • 5:30BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class

Connections

4

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

Concepts2

  • coRPknow this first
  • RPknow this first

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.