ConceptTheory & Algos
NP-hardness of approximation
The connection between probabilistically checkable proofs and the hardness of approximately solving constraint satisfaction problems.
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.