Psinger (Subset Sum The Subset-Sum Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n max(S))$
Space Complexity
$O(t)$ words
(https://dl-acm-org.ezproxy.canberra.edu.au/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.ezproxy.canberra.edu.au/science/article/abs/pii/S0196677499910349