Pisinger (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(nt/logt)$ == Space Complexity == $O(t/logt)$ words (https://link.springer.com/article/10.1007/s00453-002-0989-y) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://link.springer.com/article/10.1007/s00453-002-0989-y")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(nt/logt)$

Space Complexity

$O(t/logt)$ words

(https://link.springer.com/article/10.1007/s00453-002-0989-y)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2003

Reference

https://link.springer.com/article/10.1007/s00453-002-0989-y

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