3-SAT
See also: 3SAT
Translingual
editAlternative forms
editEtymology
editFrom SAT and 3, the number of literals per clause.
Symbol
edit3-SAT
- (computing theory) The decision problem of deciding whether a given Boolean formula in conjunctive normal form with three literals per clause is satisfiable. A famous NP-complete problem.