|
gptkbp:instanceOf
|
theoretical computer science
NP-complete problem
|
|
gptkbp:application
|
combinatorial optimization
cryptography
resource allocation
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:estimatedCost
|
yes
|
|
gptkbp:field
|
gptkb:mathematics
computer science
theoretical computer science
|
|
gptkbp:firstDescribed
|
1974
|
|
gptkbp:generalizes
|
partition problem
|
|
gptkbp:hasOptimizationVersion
|
yes
|
|
gptkbp:hasReductionFrom
|
gptkb:3-SAT
|
|
gptkbp:hasSpecialCase
|
gptkb:knapsack_problem
|
|
gptkbp:hasSubgroup
|
NP-complete problems
|
|
gptkbp:hasVersion
|
yes
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Subset sum problem
|
|
gptkbp:input
|
set of integers
target integer
|
|
gptkbp:reduces
|
partition problem
|
|
gptkbp:relatedTo
|
gptkb:knapsack_problem
partition problem
|
|
gptkbp:solvedBy
|
gptkb:meet-in-the-middle_algorithm
dynamic programming
backtracking
pseudo-polynomial time algorithm
|
|
gptkbp:type
|
Is there a subset of the given set whose sum is equal to the target integer?
|
|
gptkbp:usedIn
|
gptkb:Merkle–Hellman_knapsack_cryptosystem
|
|
gptkbp:bfsParent
|
gptkb:NP-completeness
|
|
gptkbp:bfsLayer
|
5
|