Horowitz and Sahni (Subset Sum The Subset-Sum Problem)
Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^{(n/{2})})$ == Space Complexity == $O({2}^{(n/{2})$}) (https://dl.acm.org/doi/10.1145/321812.321823) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1974 == Reference == https://dl.acm.org/doi/10.1145/321812.321823")
Time Complexity
$O({2}^{(n/{2})})$
Space Complexity
$O({2}^{(n/{2})$})
(https://dl.acm.org/doi/10.1145/321812.321823)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1974