ConceptTheory & Algos
Zero-error probabilistic polynomial time
ZPP is the complexity class of problems solvable by a probabilistic Turing machine in expected polynomial time with zero 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.
Venkatesan Guruswami
The complexity class of problems solvable by a probabilistic Turing machine in expected polynomial time with zero error, equivalent to RP intersect coRP.
Connections
4The lectures that define it or assume it, and the concepts next to it.