Serang (Subset Sum The Subset-Sum Problem): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tag: Reverted |
No edit summary Tags: Manual revert Reverted |
||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
2014 | |||
== Reference == | == Reference == | ||
https:// | https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0091507 | ||
Revision as of 11:12, 15 February 2023
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
2014
Reference
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0091507