ConceptTheory & Algos
PP
A complexity class of decision problems solved by a probabilistic Turing machine in polynomial time with error strictly less than 1/2.
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
1Ryan O'Donnell
Connections
7The lectures that define it or assume it, and the concepts next to it.