Psinger (Subset Sum The Subset-Sum Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n max(S))$ == Space Complexity == $O(t)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S0196677499910349") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(t)$ | $O(t)$ words | ||
(https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) | (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Word RAM | |||
== Year == | == Year == | ||
Latest revision as of 07:54, 10 April 2023
Time Complexity
$O(n max(S))$
Space Complexity
$O(t)$ words
(https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1999
Reference
https://www.sciencedirect.com/science/article/abs/pii/S0196677499910349