ConceptTheory & Algos
Dichotomy conjecture
The conjecture that every CSP satisfiability 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.
Complexity classes P and NP-complete1Constraint satisfaction problem1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.