|
gptkbp:instanceOf
|
theoretical computer science
|
|
gptkbp:alsoKnownAs
|
subset sum problem
|
|
gptkbp:application
|
combinatorial optimization
cryptography
resource allocation
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:describedBy
|
gptkb:Richard_Karp
|
|
gptkbp:field
|
gptkb:mathematics
computer science
|
|
gptkbp:firstDescribed
|
1974
|
|
gptkbp:generalizes
|
partition problem
|
|
gptkbp:hasVariant
|
bounded subset sum
unbounded subset sum
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Subset Sum
|
|
gptkbp:includedIn
|
gptkb:Karp's_21_NP-complete_problems
|
|
gptkbp:input
|
set of integers
target integer
|
|
gptkbp:pseudoPolynomialTimeAlgorithm
|
O(nS) where S is the target sum
|
|
gptkbp:relatedTo
|
gptkb:knapsack_problem
partition problem
|
|
gptkbp:solvedBy
|
gptkb:meet-in-the-middle_algorithm
dynamic programming
|
|
gptkbp:type
|
theoretical computer science
Is there a subset of the given set whose sum is equal to the target integer?
|
|
gptkbp:worstCaseTimeComplexity
|
O(2^n)
|
|
gptkbp:bfsParent
|
gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
|
gptkbp:bfsLayer
|
6
|