%0 Journal Article %1 journals/corr/EzraS16 %A Ezra, Esther %A Sharir, Micha %D 2016 %J CoRR %K dblp %T The Decision Tree Complexity for k-SUM is at most Nearly Quadratic. %U http://dblp.uni-trier.de/db/journals/corr/corr1607.html#EzraS16 %V abs/1607.04336

@article{journals/corr/EzraS16, added-at = {2018-08-13T00:00:00.000+0200}, author = {Ezra, Esther and Sharir, Micha}, biburl = {https://www.bibsonomy.org/bibtex/2f14c067e8b54307eda1955ba360f009e/dblp}, ee = {http://arxiv.org/abs/1607.04336}, interhash = {8c276bc1b1b719efe25ef891694eb11b}, intrahash = {f14c067e8b54307eda1955ba360f009e}, journal = {CoRR}, keywords = {dblp}, timestamp = {2018-08-14T12:39:23.000+0200}, title = {The Decision Tree Complexity for k-SUM is at most Nearly Quadratic.}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1607.html#EzraS16}, volume = {abs/1607.04336}, year = 2016 }