Content-Length: 52984 | pFad | http://en.wiktionary.org/wiki/3-SAT#Translingual

3-SAT - Wiktionary, the free dictionary Jump to content

3-SAT

From Wiktionary, the free dictionary
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]
Retrieved from "https://en.wiktionary.org/w/index.php?title=3-SAT&oldid=40677352"








 ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: http://en.wiktionary.org/wiki/3-SAT#Translingual

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy