# 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} }

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

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 12 REFERENCES

## Subquadratic encodings for point configurations

VIEW 2 EXCERPTS

## Threesomes, Degenerates, and Love Triangles

VIEW 2 EXCERPTS

## On a class of O(n2) problems in computational geometry

VIEW 1 EXCERPT

## Changing base without losing space

VIEW 1 EXCERPT

## On the possibility of faster SAT algorithms

VIEW 1 EXCERPT

## Lower bounds for linear satisfiability problems

VIEW 1 EXCERPT