Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Computational Problem
|
| gptkbp:application |
Scheduling
Resource Allocation Load Balancing |
| gptkbp:category |
gptkb:Combinatorial_Optimization
gptkb:Decision_Problem |
| gptkbp:complexity |
NP-complete
|
| gptkbp:describes |
Given a multiset of integers, decide whether it can be partitioned into two subsets with equal sum.
|
| gptkbp:field |
gptkb:Mathematics
Computer Science |
| gptkbp:firstProvenNPCompleteBy |
gptkb:Richard_Karp
|
| https://www.w3.org/2000/01/rdf-schema#label |
Partition Problem
|
| gptkbp:input |
Multiset of integers
|
| gptkbp:output |
Yes/No answer
|
| gptkbp:relatedTo |
gptkb:K-partition_Problem
gptkb:Subset_Sum_Problem |
| gptkbp:solvableInPseudoPolynomialTime |
True
|
| gptkbp:supportsAlgorithm |
gptkb:Dynamic_Programming
|
| gptkbp:yearNPComplete |
1972
|
| gptkbp:bfsParent |
gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972) |
| gptkbp:bfsLayer |
6
|