3SUM Hypothesis (3-SUM Hypothesis)
Jump to navigation
Jump to search
Target Problem
Description
3-SUM on $n$ integers in $\{-n^4,\ldots,n^4\}$ cannot be solved in $O(n^{2-\epsilon})$ time for any $\epsilon > 0$ by a randomized algorithm.
Implies the following Hypothesis
Implied by the following Hypothesis
Computation Model
Word-RAM on $\log(n)$ bit words
Proven?
No
Year
References/Citation
http://people.csail.mit.edu.ezproxy.canberra.edu.au/virgi/eccentri.pdf Hypothesis 2