Pferschy (Subset Sum The Subset-Sum Problem)
Revision as of 11:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n' t)$ == Space Complexity == $O(t)$ (https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference == https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/s006070050042")
Time Complexity
$O(n' t)$
Space Complexity
$O(t)$
(https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/3329863, Table 1)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1999
Reference
https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/s006070050042