Faaland (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 == $O(n' t)$ == Space Complexity == $O(t)$ (https://doi-org.ezproxy.canberra.edu.au/10.1287/opre.21.1.332) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1973 == Reference == https://doi-org.ezproxy.canberra.edu.au/10.1287/opre.21.1.332")

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

Jump to navigation Jump to search

Time Complexity

$O(n' t)$

Space Complexity

$O(t)$

(https://doi-org.ezproxy.canberra.edu.au/10.1287/opre.21.1.332)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1973

Reference

https://doi-org.ezproxy.canberra.edu.au/10.1287/opre.21.1.332

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