Lokshtanov (Subset Sum The Subset-Sum Problem)

From Algorithm Wiki

Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $\tilde{O}(n^{3} t)$ == Space Complexity == $O(n^{2})$ (https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2010 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/1806689.1806735")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$\tilde{O}(n^{3} t)$

Space Complexity

$O(n^{2})$

(https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/3329863, Table 1)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2010

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/1806689.1806735

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Lokshtanov_(Subset_Sum_The_Subset-Sum_Problem)&oldid=44365"