3-SAT
See also: 3SAT
Translingual
Alternative forms
Etymology
From SAT and 3, the number of literals per clause.
Symbol
3-SATCategory:Translingual lemmas#3-SATCategory:Translingual symbols#3-SATCategory:Translingual terms with redundant script codes#3-SATCategory:Translingual terms spelled with numbers#3-SATCategory:Translingual entries with incorrect language header#3-SATCategory:Pages with entries#3-SATCategory:Pages with 1 entry#3-SAT
- (computing theoryCategory:mul:Theory of computing#3-SAT) 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.