Encoding 3SUM

03/06/2019
by   Sergio Cabello, et al.
0

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 $\tilde{O}(N^{\frac 32})$ space for inputs sets of size $N$ and allows constant time queries in the word-RAM.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2018

Subquadratic Encodings for Point Configurations

For most algorithms dealing with sets of points in the plane, the only r...
research
06/25/2018

Encoding Sets as Real Numbers (Extended version)

We study a variant of the Ackermann encoding N(x) := ∑_y∈ x2^N(y) of the...
research
07/19/2019

On Approximate Range Mode and Range Selection

For any ϵ∈ (0,1), a (1+ϵ)-approximate range mode query asks for the posi...
research
05/19/2018

Orthogonal Point Location and Rectangle Stabbing Queries in 3-d

In this work, we present a collection of new results on two fundamental ...
research
06/19/2019

Indexing Graph Search Trees and Applications

We consider the problem of compactly representing the Depth First Search...
research
10/31/2018

A Two Query Adaptive Bitprobe Scheme Storing Five Elements

We are studying the adaptive bitprobe model to store an arbitrary subset...
research
05/23/2022

Generalized fusible numbers and their ordinals

Erickson defined the fusible numbers as a set ℱ of reals generated by re...

Please sign up or login with your details

Forgot password? Click here to reset