ConceptTheory & Algos
Satisfiability in 2-SAT
An assignment of truth values to variables is satisfying if it makes all implication constraints true, which in 2-SAT can be analyzed via paths in a directed graph.
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.