Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:describedBy |
Given a set and a collection of subsets, is it possible to partition the set into two subsets so that no subset in the collection is entirely contained in either part?
|
| gptkbp:field |
computer science
theoretical computer science |
| gptkbp:firstProvenNPCompleteBy |
gptkb:Richard_Karp
|
| gptkbp:hasApplication |
circuit design
scheduling |
| gptkbp:hasReductionFrom |
gptkb:3SAT
|
| https://www.w3.org/2000/01/rdf-schema#label |
Set splitting problem
|
| gptkbp:includedIn |
gptkb:Karp's_21_NP-complete_problems
|
| gptkbp:reduces |
graph coloring problem
|
| gptkbp:relatedTo |
gptkb:set_theory
combinatorics |
| gptkbp:yearNPComplete |
1972
|
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
6
|