(redirected from 3-satisfiability)
3SAT3-Satisfiability (Boolean satisfiability problem expressed in 3CNF form)
3SATSoldier Survival System, Advanced Threat
References in periodicals archive ?
Orponen, "An efficient local search method for random 3-satisfiability," Electronic Notes in Discrete Mathematics, vol.
6] study this problem as a geometric embedding problem and prove it is NP Complete by reduction from the 3-satisfiability problem (3SAT) (1).
disjunction]3]) corresponds to the 3-SATISFIABILITY problem, which is well-known to be NP-complete [Garey and Johnson 1979].