Near-optimal linear decision trees for k-SUM and related problems

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 554-563, 2018.

Cited by: 31|Bibtex|Views10|Links
EI
Keywords:
Linear decision treehyperplane arrangementinference dimension

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 log2n) linear queries. Moreover, the queries we use are comparison queries, which compare the su...More

Code:

Data:

Your rating :
0

 

Tags
Comments