Klinz (Subset Sum The Subset-Sum Problem)
Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(σ^{({3}/{2})})$ == 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://doi-org.ezproxy.canberra.edu.au/10.1002/(SICI)1097-0037(199905)33:3%3C189::AID-NET5%3E3.0.CO;2-2")
Time Complexity
$O(σ^{({3}/{2})})$
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