ConceptTheory & Algos
Unique games hardness
A hardness result based on the Unique Games Conjecture, establishing that approximating certain constraint satisfaction problems as well as a specific algorithm is NP-hard.
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
3The lectures that define it or assume it, and the concepts next to it.