ConceptTheory & Algos
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.
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
2Each in their own terms, from the easiest level.
Venkatesan Guruswami
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.Ryan O'Donnell
Connections
7The lectures that define it or assume it, and the concepts next to it.