Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:definedIn |
satisfiability of Boolean formulas in conjunctive normal form with exactly three literals per clause
|
| gptkbp:firstProvedNPCompleteBy |
gptkb:Richard_Karp
|
| gptkbp:generalizes |
gptkb:2SAT
|
| gptkbp:hasApplication |
gptkb:logic
operations research theoretical computer science circuit design |
| gptkbp:hasClauseType |
disjunction of three literals
|
| gptkbp:hasFormulaType |
conjunction of clauses
|
| gptkbp:hasSpecialCase |
gptkb:k-SAT
|
| gptkbp:hasUnsolvedProblems |
polynomial time algorithm (P vs NP)
|
| https://www.w3.org/2000/01/rdf-schema#label |
3SAT
|
| gptkbp:isSolvable |
exponential time (worst case)
|
| gptkbp:NP-complete |
true
|
| gptkbp:reduces |
gptkb:SAT
many other NP-complete problems |
| gptkbp:usedAs |
benchmark for SAT solvers
|
| gptkbp:usedIn |
gptkb:artificial_intelligence
cryptography algorithm design theory of computational complexity |
| gptkbp:variableType |
Boolean variable
|
| gptkbp:yearNPCompletenessProved |
1972
|
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
6
|