Statements (36)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:citation |
Cook, S. A. (1971). The complexity of theorem-proving procedures.
Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability. |
| gptkbp:complexity |
NP-complete (for k ≥ 3)
P (for k = 2) |
| gptkbp:definedIn |
Boolean satisfiability problem where each clause has exactly k literals
|
| gptkbp:field |
computer science
theoretical computer science |
| gptkbp:generalizes |
gptkb:3-SAT
gptkb:2-SAT |
| gptkbp:hardnessThreshold |
k = 3
|
| gptkbp:hasSpecialCase |
gptkb:3-SAT
gptkb:2-SAT gptkb:1-SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
k-SAT
|
| gptkbp:input |
Boolean formula in conjunctive normal form (CNF) with k literals per clause
|
| gptkbp:NP-completeFor |
k ≥ 3
|
| gptkbp:output |
true if the formula is satisfiable, false otherwise
|
| gptkbp:polynomialTimeSolvableFor |
k = 2
|
| gptkbp:relatedTo |
gptkb:P_vs_NP_problem
Boolean satisfiability problem |
| gptkbp:solvedBy |
gptkb:DPLL_algorithm
gptkb:WalkSAT_algorithm backtracking algorithms local search algorithms |
| gptkbp:studiedBy |
gptkb:Stephen_Cook
1971 |
| gptkbp:usedIn |
gptkb:artificial_intelligence
cryptography theory of computation circuit design |
| gptkbp:bfsParent |
gptkb:3-SAT
gptkb:Boolean_satisfiability_problem gptkb:SAT_problem |
| gptkbp:bfsLayer |
6
|