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

Daniel M. Kane, Shachar Lovett, Shay Moran. Near-optimal linear decision trees for k-SUM and related problems. Electronic Colloquium on Computational Complexity (ECCC), 24:82, 2017. [doi]

@article{KaneLM17,
  title = {Near-optimal linear decision trees for k-SUM and related problems},
  author = {Daniel M. Kane and Shachar Lovett and Shay Moran},
  year = {2017},
  url = {https://eccc.weizmann.ac.il/report/2017/082},
  researchr = {https://researchr.org/publication/KaneLM17},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {24},
  pages = {82},
}