ConceptTheory & Algos
Mini-PCP
A step in the reduction that transforms a CSP with a very large domain size and complicated binary constraints back down to a standard 3-coloring constraint satisfaction problem.
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.