ConceptTheory & Algos
Sigma 2 P ()
A complexity class containing languages decidable by a polynomial-time verifier with an 'exists-for-all' quantifier structure.
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
3The lectures that define it or assume it, and the concepts next to it.