Baran, Demaine, Patrascu (Integer 3SUM 3SUM): Difference between revisions

From Algorithm Wiki
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
Tag: Manual revert
 
(9 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


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


== Space Complexity ==  
== Space Complexity ==  


  words
   


()
()
Line 23: Line 23:
== Model of Computation ==  
== Model of Computation ==  


Word RAM
Cache oblivious


== Year ==  
== Year ==  

Latest revision as of 10:43, 28 April 2023

Time Complexity

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

Space Complexity

()

Description

Approximate?

Exact

Randomized?

Yes, Las Vegas

Model of Computation

Cache oblivious

Year

2008

Reference

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