ConceptTheory & Algos
Boppana-Hostad-Zachos theorem
A theorem stating that if any language in coAM is NP-complete, then the polynomial hierarchy collapses to the second level.
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
4The lectures that define it or assume it, and the concepts next to it.