Can 3SUM be solved in strongly sub-quadratic time, that is, in time O(n2−ϵ) for some ϵ > 0?

Open the “Other algorithmic problems” section on Wikipedia →

Source: List of unsolved problems in computer science (CC BY-SA 4.0)