Sign inSign in

BPP

The class of languages decidable by a probabilistic polynomial-time Turing machine with an error probability of at most 1/3.
as Michael Sipser defines itMITThe wording closest to all 7 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

3

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    • 5:04Probabilistic Computation
  • Venkatesan Guruswami

    Carnegie Mellon University · Undergraduate

    Bounded-error probabilistic polynomial-time is the class of languages recognized by a deterministic Turing machine taking a polynomial-length random string with success probability at least 2/3.
    • 23:20BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A complexity class representing decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability of at most 1/3.
    • 3:55Pseudorandom Generators
    • 1:10:03Course Introduction and Overview
    • 20:00Quantum Complexity
    • 1:00:00Introduction to Arthur-Merlin classes, MA and AM

Lectures that assume it

8

Connections

24

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

3 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.