Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:appliesTo |
resource allocation
scheduling bin packing |
| gptkbp:complexity |
NP-complete
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
3-partition problem
|
| gptkbp:input |
multiset of integers
|
| gptkbp:introducedIn |
Garey and Johnson, 1979
|
| gptkbp:relatedTo |
subset sum problem
partition problem |
| gptkbp:stronglyNPComplete |
true
|
| gptkbp:type |
Can the multiset be partitioned into triples with equal sum?
|
| gptkbp:usedIn |
complexity reductions
|
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|