Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:decision |
true
|
| gptkbp:defines |
Given a finite set and a collection of its subsets, determine if the set can be partitioned into two subsets such that no subset in the collection is entirely contained in either part.
|
| gptkbp:field |
theoretical computer science
combinatorics |
| gptkbp:firstDescribed |
1979
|
| https://www.w3.org/2000/01/rdf-schema#label |
set splitting problem
|
| gptkbp:input |
finite set and collection of subsets
|
| gptkbp:notableFor |
gptkb:Karp's_21_NP-complete_problems
|
| gptkbp:output |
yes/no answer
|
| gptkbp:relatedTo |
partition problem
set cover problem |
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|