Corpus ID: 71145423

Encoding 3SUM

@article{Cabello2019Encoding3,
  title={Encoding 3SUM},
  author={Sergio Cabello and Jean Cardinal and John Iacono and Stefan Langerman and Pat Morin and Aur{\'e}lien Ooms},
  journal={ArXiv},
  year={2019},
  volume={abs/1903.02645}
}
  • Sergio Cabello, Jean Cardinal, +3 authors Aurélien Ooms
  • Published in ArXiv 2019
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    3
    Twitter Mentions

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES

    Threesomes, Degenerates, and Love Triangles

    VIEW 2 EXCERPTS

    On the possibility of faster SAT algorithms

    VIEW 1 EXCERPT

    Lower bounds for linear satisfiability problems

    VIEW 1 EXCERPT

    Overmars . On a class of O ( n 2 ) problems in computational geometry

    • E Jacob
    • Comput . Geom .
    • 1995

    Better lower bounds on detecting affine and spherical degeneracies

    • Nir Ailon, Bernard Chazelle
    • Computer Science, Mathematics
    • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
    • 1993
    VIEW 1 EXCERPT