ConceptTheory & Algos
Ladner's theorem
A theorem stating that if P != NP, then there exist languages in NP that are neither in P nor NP-complete.
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
1Ryan O'Donnell
Connections
7The lectures that define it or assume it, and the concepts next to it.