ConceptTheory & Algos
BPP
The class of languages decidable by a probabilistic polynomial-time Turing machine with an error probability of at most 1/3.
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
3Each in their own terms, from the easiest level.
Michael Sipser
Venkatesan Guruswami
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.Ryan O'Donnell
A complexity class representing decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability of at most 1/3.
Lectures that assume it
8- Ironic Complexity
- Probabilistic Complexity Classes
- Toda's Second Theorem and Lower Bounds for Uniform ACC
- Hardness vs. Randomness I
- Hardness vs. Randomness II
- Valiant–Vazirani Theorem, and Exact Counting (#P)
- Super Turing Computing: Foundations for Aware and Ever-Adapting Systems
- More on constant-round interactive proof systems
Connections
24The lectures that define it or assume it, and the concepts next to it.
Concepts9
Lectures15
- Pseudorandom Generators
- BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
- Course Introduction and Overview
- Probabilistic Computation
- Quantum Complexity
- Probabilistic Computation, BPP
Show 9 moreShow fewer
- Introduction to Arthur-Merlin classes, MA and AM
- Ironic Complexity
- Probabilistic Complexity Classes
- Toda's Second Theorem and Lower Bounds for Uniform ACC
- Hardness vs. Randomness I
- Hardness vs. Randomness II
- Valiant–Vazirani Theorem, and Exact Counting (#P)
- Super Turing Computing: Foundations for Aware and Ever-Adapting Systems
- More on constant-round interactive proof systems