ConceptTheory & Algos
Bauderon-host-Ader theorem
Theorem showing that if a language in coAM is NP-complete, then NP equals coNP and the polynomial hierarchy collapses to level 2.
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.