The Decision Tree Complexity for $k$-SUM is at most Nearly Quadratic
Esther E. Ezra, Micha Sharir · arXiv (Cornell University) · 2016
Following a recent improvement of Cardinal et al. on the complexity of a linear decision tree for $k$-SUM, resulting in $O(n^3 \log^3{n})$ linear queries, we present a further improvement to $O(n^2 \log^2{n})$ such queries.