Improved Subquadratic 3SUM

In the 3SUM problem we are given three lists A , B , C , of n real numbers, and are asked to find ( a , b , c ) ∈ A × B × C such that a + b = c . The longstanding 3SUM conjecture —that 3SUM could not be solved in subquadratic time—was recently refuted by Grønlund and Pettie. They presented O n 2 ( log log n ) α / ( log n ) β algorithms for 3SUM and for the related problems Convolution3SUM and ZeroTriangle, where α and β are constants that depend on the problem and whether the algorithm is deterministic or randomized (and for ZeroTriangle the main factor is n 3 rather than n 2 ). We simplify Grønlund and Pettie’s algorithms and obtain better bounds, namely, α = β = 1 , deterministically. For 3SUM our bound is better than both the deterministic and the randomized bounds of Grønlund and Pettie. For the other problems our bounds are better than their deterministic bounds, and match their randomized bounds.