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.
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.
Source: Wikipedia "3SUM" · CC BY-SA 4.0
Share this article: X · Bluesky