Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
gptkb:knapsack_problem
crypt subset sum problem |
| gptkbp:approach |
divide and conquer
|
| gptkbp:complexity |
O(2^{n/2})
|
| gptkbp:firstDescribed |
1970s
|
| https://www.w3.org/2000/01/rdf-schema#label |
Meet in the Middle
|
| gptkbp:reducesComplexity |
yes
|
| gptkbp:spaceComplexity |
O(2^{n/2})
|
| gptkbp:usedFor |
solving certain computational problems
|
| gptkbp:usedIn |
computer science
|
| gptkbp:bfsParent |
gptkb:Diamond_Rio
gptkb:Bran'Nu |
| gptkbp:bfsLayer |
7
|