Gronlund, Pettie (Real 3SUM 3SUM): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n^{2}/((log n)$/(log log n))^{2}/{3}) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 2014 == Reference == https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/6979047")
 
No edit summary
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


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


== Space Complexity ==  
== Space Complexity ==  
Line 19: Line 19:
== Randomized? ==  
== Randomized? ==  


No, deterministic
Yes, Las Vegas


== Model of Computation ==  
== Model of Computation ==  

Revision as of 11:18, 15 February 2023

Time Complexity

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

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

Yes, Las Vegas

Model of Computation

Real RAM

Year

2014

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/6979047