ConceptTheory & Algos
PP complexity class
A complexity class defined by probabilistic Turing machines that accept strings with probability strictly greater than 1/2 if they are in the language and at most 1/2 otherwise.
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
1Lectures that assume it
2Connections
8The lectures that define it or assume it, and the concepts next to it.