Bringman (Subset Sum The Subset-Sum Problem)
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $\tilde{O}(nt^{1+\epsilon})$ == Space Complexity == \tilde{O}(nt^\epsilon) (https://arxiv.org/abs/1610.04712) == Description == == Approximate? == Approximate Approximation Factor: (n+t)^{-\Omega(1)} error == Randomized? == Yes, Monte Carlo == Model of Computation == == Year == 2017 == Reference == https://arxiv.org/abs/1610.04712")
Time Complexity
$\tilde{O}(nt^{1+\epsilon})$
Space Complexity
\tilde{O}(nt^\epsilon)
(https://arxiv.org/abs/1610.04712)
Description
Approximate?
Approximate
Approximation Factor: (n+t)^{-\Omega(1)} error
Randomized?
Yes, Monte Carlo
Model of Computation
Year
2017