Lokshtanov (Subset Sum The Subset-Sum Problem)
Jump to navigation
Jump to search
Time Complexity
$\tilde{O}(n^{3} t)$
Space Complexity
$O(n^{2})$
(https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2010