Baran, Demaine, Patrascu (Integer 3SUM 3SUM)

From Algorithm Wiki

Revision as of 08:55, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(n^{2}/max(w/(log w)$^{2}, (log n)^{2}/(log log n)^{2}))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

Yes, Las Vegas

Model of Computation

Word RAM

Year

2008

Reference

https://link.springer.com/article/10.1007/s00453-007-9036-3

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Baran,_Demaine,_Patrascu_(Integer_3SUM_3SUM)&oldid=47565"