ConceptTheory & Algos
A complexity class in the polynomial hierarchy corresponding to .
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
2Each in their own terms, from the easiest level.
Anil Adad
A complexity class containing languages decidable by a polynomial-time verifier with an existential and then a universal quantifier.
Connections
6The lectures that define it or assume it, and the concepts next to it.