ConceptTheory & Algos
Feder-Vardi conjecture
The conjecture stating that every Constraint Satisfaction Problem is either in P or NP-complete.
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.