Bringman (Subset Sum The Subset-Sum Problem)

From Algorithm Wiki

Revision as of 07:54, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$\tilde{O}(nt^{1+\epsilon})$

Space Complexity

\tilde{O}(nt^\epsilon) words

(https://arxiv.org/abs/1610.04712)

Description

Approximate?

Approximate

Approximation Factor: (n+t)^{-\Omega(1)} error

Randomized?

Yes, Monte Carlo

Model of Computation

Word RAM

Year

2017

Reference

https://arxiv.org/abs/1610.04712

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