ConceptTheory & Algos
Optimal hardness
A hardness result that matches the bound of an existing efficient algorithm, showing that no algorithm can achieve a better approximation ratio.
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.