Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
cryptography
resource allocation |
| gptkbp:approximation |
pseudo-polynomial time algorithms
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:firstDescribed |
1974
|
| https://www.w3.org/2000/01/rdf-schema#label |
Subset Sum Problem
|
| gptkbp:input |
set of integers
target integer |
| gptkbp:listedOn |
gptkb:Karp's_21_NP-complete_problems
|
| gptkbp:notableContributor |
gptkb:Richard_Karp
|
| gptkbp:relatedTo |
gptkb:Knapsack_Problem
gptkb:Partition_Problem |
| gptkbp:solvedBy |
gptkb:meet-in-the-middle_algorithm
dynamic programming backtracking |
| gptkbp:type |
Is there a subset of the given set that sums to the target integer?
|
| gptkbp:usedIn |
gptkb:Merkle–Hellman_knapsack_cryptosystem
|
| gptkbp:worstCaseTimeComplexity |
O(2^n)
|
| gptkbp:bfsParent |
gptkb:Knapsack_Problem
gptkb:Partition_Problem |
| gptkbp:bfsLayer |
7
|