ConceptTheory & Algos
Randomized provers
Provers that use randomness to choose their messages, which do not increase the power or enlarge the class of languages with efficient proof systems.
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
1Connections
2The lectures that define it or assume it, and the concepts next to it.