Serang (Subset Sum The Subset-Sum Problem): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tag: Reverted |
No edit summary Tag: Manual revert |
| (One intermediate revision by the same user not shown) | |
(No difference)
| |
Latest revision as of 09:16, 28 April 2023
Time Complexity
$\tilde{O}(n max(S))$
Space Complexity
$O(t logt)$
(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
2015