Statements (43)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem NP-complete problem |
| gptkbp:affiliatedWith |
k-satisfiability
|
| gptkbp:alsoKnownAs |
gptkb:3-SAT
3CNF-SAT |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
the problem of determining if a Boolean formula in conjunctive normal form with at most three literals per clause is satisfiable
|
| gptkbp:firstProvedNPCompleteBy |
gptkb:Richard_Karp
gptkb:Stephen_Cook |
| gptkbp:format |
satisfiable or unsatisfiable
3-CNF formula |
| gptkbp:hasExponentialTimeAlgorithm |
yes
|
| gptkbp:hasPolynomialTimeAlgorithm |
no (unless P=NP)
|
| https://www.w3.org/2000/01/rdf-schema#label |
3-satisfiability
|
| gptkbp:isCanonicalExampleOf |
NP-complete problem
|
| gptkbp:isEasierThan |
general SAT (in terms of clause length)
|
| gptkbp:isHarderThan |
2-satisfiability
|
| gptkbp:maximumClauseLength |
3
|
| gptkbp:minimumClauseLength |
1
|
| gptkbp:numberOfLiteralsPerClause |
3
|
| gptkbp:reduces |
gptkb:clique_problem
gptkb:independent_set_problem gptkb:vertex_cover_problem general SAT |
| gptkbp:relatedTo |
Boolean satisfiability problem
2-satisfiability k-satisfiability |
| gptkbp:solvedBy |
gptkb:government_agency
gptkb:DPLL_algorithm brute-force search WalkSAT |
| gptkbp:usedFor |
benchmarking SAT solvers
complexity theory reductions theoretical computer science research |
| gptkbp:usedIn |
gptkb:artificial_intelligence
cryptography algorithm design circuit design theory of computational complexity |
| gptkbp:yearNPCompletenessProved |
1972
|
| gptkbp:bfsParent |
gptkb:Clique_problem
|
| gptkbp:bfsLayer |
6
|