ConceptTheory & Algos
Randomized polynomial time
A complexity class for languages recognized by a probabilistic Turing machine in polynomial time with one-sided error.
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.
Ryan O'Donnell
The class of languages decided by a randomized polynomial-time Turing machine with one-sided error.
Connections
7The lectures that define it or assume it, and the concepts next to it.