The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Using hashing techniques, this paper develops a family of space-efficient Las Vegas randomized algorithms for k-SUM problems. This family includes an algorithm that can solve 3-SUM in O(n^2) time and O(√(n)) space. It also establishes a new time-space upper bound for SUBSET-SUM, which can be solved by a Las Vegas algorithm in O^*(2^(1-√(/9β))n) time and O^*(2^β n) space, for any β∈ [0, /32].arXiv:1303.1016v2 fatcat:m4qzeqv62zbkljc4g43clz4aqu