Freund (Real 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}*(log log n)$/(log n)) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 2017 == Reference == https://link.springer.com/article/10.1007/s00453-015-0079-6")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2}*(log log n)$/(log n))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

2017

Reference

https://link.springer.com/article/10.1007/s00453-015-0079-6

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Freund_(Real_3SUM_3SUM)&oldid=45680"