ConceptTheory & Algos
Håstad switching lemma
A lemma stating that applying a random restriction to a wide CNF or DNF formula collapses it into a shallow decision tree with high probability.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Ryan O'Donnell
Connections
5The lectures that define it or assume it, and the concepts next to it.