The Decision Tree Complexity for $k$-SUM is at most Nearly Quadratic
Computational Geometry
2016-07-18 v1
Abstract
Following a recent improvement of Cardinal et al. on the complexity of a linear decision tree for -SUM, resulting in linear queries, we present a further improvement to such queries.
Cite
@article{arxiv.1607.04336,
title = {The Decision Tree Complexity for $k$-SUM is at most Nearly Quadratic},
author = {Esther Ezra and Micha Sharir},
journal= {arXiv preprint arXiv:1607.04336},
year = {2016}
}