Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
problem in computational complexity theory
|
| gptkbp:abbreviation |
gptkb:Exact_Cover_by_3-Sets
|
| gptkbp:appearsIn |
gptkb:Karp's_21_NP-complete_problems
|
| gptkbp:category |
NP-complete problem
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:firstDescribed |
gptkb:Richard_Karp
1972 |
| gptkbp:fullName |
gptkb:Exact_Cover_by_3-Sets
|
| gptkbp:hasOptimizationVersion |
no
|
| gptkbp:hasPolynomialTimeAlgorithm |
unknown (believed not to exist)
|
| gptkbp:hasVersion |
yes
|
| https://www.w3.org/2000/01/rdf-schema#label |
X3C
|
| gptkbp:input |
collection C of 3-element subsets of X
finite set X |
| gptkbp:reduces |
gptkb:3SAT
gptkb:3-dimensional_matching |
| gptkbp:relatedTo |
gptkb:Set_cover_problem
gptkb:3-dimensional_matching |
| gptkbp:type |
Does C contain an exact cover for X?
|
| gptkbp:usedIn |
theory of NP-completeness
proving NP-completeness of other problems |
| gptkbp:bfsParent |
gptkb:Exact_cover_by_3-sets
gptkb:Exact_Cover_by_3-Sets |
| gptkbp:bfsLayer |
7
|