Horowitz and Sahni (Subset Sum The Subset-Sum Problem)
Jump to navigation
Jump to search
Time Complexity
$O({2}^{(n/{2})})$
Space Complexity
$O({2}^{(n/{2})$}) words
(https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321812.321823)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1974
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321812.321823