ConceptTheory & Algos
3SAT
The problem of checking if a given CNF formula with at most three literals per clause is satisfiable.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Erik Demaine
The problem of determining if a Boolean formula in conjunctive normal form with exactly three literals per clause is satisfiable.Michael Sipser
The satisfiability problem restricted to 3CNF formulas.
Lectures that assume it
7Connections
19The lectures that define it or assume it, and the concepts next to it.