Koiliaris and Xu (Subset Sum The Subset-Sum Problem)

From Algorithm Wiki
Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $\tilde{O}(min{\sqrt{n'}t, t^{5/4}, σ})$ == Space Complexity == $O(t)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2019 == Reference == https://dl.acm.org/doi/pdf/10.1145/3329863")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$\tilde{O}(min{\sqrt{n'}t, t^{5/4}, σ})$

Space Complexity

$O(t)$

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

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2019

Reference

https://dl.acm.org/doi/pdf/10.1145/3329863