Pisinger (Subset Sum The Subset-Sum Problem)
Jump to navigation
Jump to search
Time Complexity
$O(nt/logt)$
Space Complexity
$O(t/logt)$ words
(https://link.springer.com/article/10.1007/s00453-002-0989-y)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2003