subset sum problem (optimization version)
GPTKB entity
Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
cryptography
finance resource allocation |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:firstDescribed |
1970s
|
| gptkbp:hasExactAlgorithm |
pseudo-polynomial time algorithm
|
| gptkbp:hasSpecialCase |
gptkb:knapsack_problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
subset sum problem (optimization version)
|
| gptkbp:input |
set of integers
target integer |
| gptkbp:output |
subset of input integers with sum as close as possible to target without exceeding it
|
| gptkbp:relatedTo |
gptkb:knapsack_problem
subset sum problem (decision version) |
| gptkbp:solvedBy |
dynamic programming
approximation algorithms branch and bound |
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|