ConceptTheory & Algos
Håstad's theorem
A theorem stating the NP-hardness of distinguishing between almost fully satisfiable and barely better than random instances of Max-3XOR CSP.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.