Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n t)$
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
1956
Reference
https://onlinelibrary-wiley-com.ezproxy.canberra.edu.au/doi/10.1002/nav.3800030107