See also: 3SAT

Translingual

edit

Alternative forms

edit

Etymology

edit

From SAT and 3, the number of literals per clause.

Symbol

edit

3-SAT

  1. (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.

See also

edit