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

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
Tag: Reverted
No edit summary
Tags: Manual revert Reverted
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


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


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


   
  words


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


Cache oblivious
Word RAM


== Year ==  
== Year ==  

Revision as of 09:55, 10 April 2023

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