Serang (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 max(S))$ == Space Complexity == $O(t logt)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2014 == Reference == https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0091507")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$\tilde{O}(n max(S))$

Space Complexity

$O(t logt)$

(https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2014

Reference

https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0091507

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Serang_(Subset_Sum_The_Subset-Sum_Problem)&oldid=44363"