ConceptTheory & Algos
Boolean constraint satisfaction problems
A family of problems where inputs consist of variables with a domain of {0, 1} and a set of constraints, and the goal is to find an assignment satisfying all constraints.
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.
Boolean variables1Complexity classes P and NP1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.