ConceptTheory & Algos
Håstad's 3Lin hardness theorem
A theorem stating that it is UG-hard to approximate Max-E3Lin beyond a 1/2 plus delta threshold.
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.
Fourier analysis of Boolean functions1Unique games conjecture1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.