A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Deterministic Time-Space Tradeoffs for k-SUM
[article]

2016
*
arXiv
*
pre-print

Given a set of numbers, the $k$-SUM problem asks for a subset of $k$ numbers that sums to zero. When the numbers are integers, the time and space complexity of $k$-SUM is generally studied in the word-RAM model; when the numbers are reals, the complexity is studied in the real-RAM model, and space is measured by the number of reals held in memory at any point. We present a time and space efficient deterministic self-reduction for the $k$-SUM problem which holds for both models, and has many

arXiv:1605.07285v1
fatcat:lqax3ksdsjcvrpuhngobdtn2yy