Near-optimal Linear Decision Trees for k-SUM and Related Problems

Journal of the ACM, pp. 1-18, 2019.

Cited by: 31|Bibtex|Views21|Links
EI

Abstract:

We construct near-optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry. For example, for any constant k, we construct linear decision trees that solve the k-SUM problem on n elements using O(n log2 n) linear queries. Moreover, the queries we use are comparison queries, which compare the s...More

Code:

Data:

Your rating :
0

 

Tags
Comments