Rare
3SUM
Problem in computational complexity theory
3SUM
In computational complexity theory, the 3SUM problem asks if a given set of n {\displaystyle n} real numbers contains three elements that sum to zero. A generalized version, k {\displaystyle k} -SUM, asks the same question on k {\displaystyle k} elements, rather than simply 3. 3SUM can be easily solved in O ( n 2 ) {\displaystyle O(n^{2})} time, and matching Ω ( n ⌈ k / 2 ⌉ ) {\displaystyle \Omega (n^{\lceil k/2\rceil })} lower bounds are known in some specialized models of computation (Erickson 1999). It was conjectured that any deterministic...
Open boosters, collect cards and trade them. Free to play.
Play for free