Sign inSign in

Bounded-error probabilistic polynomial time

The class of languages decided by a polynomial-time probabilistic Turing machine with an error probability of at most 1/3 on all inputs.
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.

Lecturers

2

Each in their own terms, from the easiest level.

  • Venkatesan Guruswami

    Carnegie Mellon University · Undergraduate

    The class of languages recognized by a probabilistic Turing machine in polynomial time with two-sided error bounded away from 1/2 by a constant.
    • 2:36BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

Connections

7

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

Concepts4

Lectures3

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.