arXiv Open Access 2016

The Decision Tree Complexity for $k$-SUM is at most Nearly Quadratic

Esther Ezra Micha Sharir

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CG

Penulis (2)

Esther Ezra

Micha Sharir

Format Sitasi

APA MLA BibTeX

Ezra, E., Sharir, M. (2016). The Decision Tree Complexity for $k$-SUM is at most Nearly Quadratic. https://arxiv.org/abs/1607.04336

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓