ConceptTheory & Algos
Karp-Lipton theorem
A theorem stating that if NP is contained in P/poly, then the polynomial time hierarchy collapses.
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
5The lectures that define it or assume it, and the concepts next to it.