Eppstein (Subset Sum The Subset-Sum Problem)
Revision as of 09:29, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $\tilde{O}(n max(S))$ == Space Complexity == $O(t logt)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S019667749690841X?via%3Dihub")
Time Complexity
$\tilde{O}(n max(S))$
Space Complexity
$O(t logt)$
(https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1997
Reference
https://www.sciencedirect.com/science/article/abs/pii/S019667749690841X?via%3Dihub