Encoding 3SUM
Data Structures and Algorithms
2019-03-08 v1 Computational Geometry
Abstract
We consider the following problem: given three sets of real numbers, output a word-RAM data structure from which we can efficiently recover the sign of the sum of any triple of numbers, one in each set. This is similar to a previous work by some of the authors to encode the order type of a finite set of points. While this previous work showed that it was possible to achieve slightly subquadratic space and logarithmic query time, we show here that for the simpler 3SUM problem, one can achieve an encoding that takes space for inputs sets of size and allows constant time queries in the word-RAM.
Cite
@article{arxiv.1903.02645,
title = {Encoding 3SUM},
author = {Sergio Cabello and Jean Cardinal and John Iacono and Stefan Langerman and Pat Morin and Aurélien Ooms},
journal= {arXiv preprint arXiv:1903.02645},
year = {2019}
}