Baran, Demaine, Patrascu (Integer 3SUM 3SUM): Difference between revisions
Jump to navigation
Jump to search
(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/article/10.1007/s00453-007-9036-3") |
No edit summary |
||
Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{2}/ | $O(n^{2}/(w^{2}/(log w)$^{2})) | ||
== Space Complexity == | == Space Complexity == | ||
() | () | ||
Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Circuit RAM with one nonstandard AC^0 operation | |||
== Year == | == Year == |
Revision as of 12:18, 15 February 2023
Time Complexity
$O(n^{2}/(w^{2}/(log w)$^{2}))
Space Complexity
()
Description
Approximate?
Exact
Randomized?
Yes, Las Vegas
Model of Computation
Circuit RAM with one nonstandard AC^0 operation
Year
2008