Horowitz and Sahni (Subset Sum The Subset-Sum Problem)

From Algorithm Wiki
Revision as of 08:54, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^{(n/{2})})$

Space Complexity

$O({2}^{(n/{2})$}) words

(https://dl.acm.org/doi/10.1145/321812.321823)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1974

Reference

https://dl.acm.org/doi/10.1145/321812.321823