ConceptTheory & Algos
Monotone switching lemma
A lemma stating that any k-CNF can be approximated by a narrow DNF plus a small exact DNF error term under certain conditions.
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
2The lectures that define it or assume it, and the concepts next to it.