2-SAT

See also: 2SAT

Translingual edit

English Wikipedia has an article on:

2-satisfiability

Alternative forms edit

2SAT

Etymology edit

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

Symbol edit

2-SAT

(computing theory) The decision problem of deciding whether a given Boolean formula in conjunctive normal form with two literals per clause is satisfiable.

See also edit

3-SAT
SAT

Retrieved from "https://en.wiktionary.org/w/index.php?title=2-SAT&oldid=40677318"