ConceptTheory & Algos
Raz's theorem
A theorem stating that approximating the Label Cover problem to within any constant factor delta is NP-hard for sufficiently large domain size q.
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.