meet-in-the-middle algorithm
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
gptkb:knapsack_problem
subset sum problem double encryption attack |
| gptkbp:complexity |
O(2^{n/2})
|
| gptkbp:firstDescribed |
1974
Horowitz and Sahni |
| https://www.w3.org/2000/01/rdf-schema#label |
meet-in-the-middle algorithm
|
| gptkbp:reduces |
space complexity
time complexity |
| gptkbp:spaceComplexity |
O(2^{n/2})
|
| gptkbp:strategy |
combine solutions from both sides
divide problem into two parts |
| gptkbp:usedFor |
crypt
solving search problems |
| gptkbp:usedIn |
computer science
|
| gptkbp:bfsParent |
gptkb:Subset_sum_problem
|
| gptkbp:bfsLayer |
6
|