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

From Algorithm Wiki
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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.ezproxy.canberra.edu.au/article/10.1007/s00453-007-9036-3")
(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.ezproxy.canberra.edu.au/article/10.1007/s00453-007-9036-3

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