Schroeppel and Shamir's algorithm for subset sum problem
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
O(2^{n/2})
|
| https://www.w3.org/2000/01/rdf-schema#label |
Schroeppel and Shamir's algorithm for subset sum problem
|
| gptkbp:improves |
naive subset sum algorithm
|
| gptkbp:proposedBy |
gptkb:Adi_Shamir
gptkb:Richard_Schroeppel |
| gptkbp:publishedIn |
gptkb:Information_Processing_Letters
|
| gptkbp:solvedBy |
subset sum problem
|
| gptkbp:spaceComplexity |
O(2^{n/4})
|
| gptkbp:technique |
meet-in-the-middle
|
| gptkbp:yearProposed |
1981
|
| gptkbp:bfsParent |
gptkb:Richard_Schroeppel
|
| gptkbp:bfsLayer |
6
|