3-SAT

See also: 3SAT

Translingual

Alternative forms

Etymology

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

Symbol

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
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.