ConceptTheory & Algos
Polynomial hierarchy
A hierarchy of complexity classes that generalize P, NP, and coNP using alternating quantifiers.
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.
Ryan O'Donnell
Anil Adad
A hierarchy of complexity classes alternating between existential and universal quantifiers starting from P, NP, and coNP.
Lectures that assume it
3Connections
16The lectures that define it or assume it, and the concepts next to it.