2 problems

In the $(k,N,r)$-SUM problem, the input consists of $r$ elements $z_1,\ldots,z_r$, independently and uniformly chosen from $\{-N,\ldots,N\}$. The goal is to find an ordered $k$-tup…

For parameters $k=O(1)$ and $r$, the $k$-SUM problem gives a list of $r$ numbers and asks for $k$ of them whose sum is zero, assuming a solution exists. A sort-and-match algorithm…