A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM (Q4580116)
From MaRDI portal
scientific article; zbMATH DE number 6917060
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM |
scientific article; zbMATH DE number 6917060 |
Statements
13 August 2018
0 references
\(k\)-SUM
0 references
\(k\)-LDT
0 references
linear decision tree
0 references
hyperplane arrangements
0 references
point-location
0 references
vertical decompositions
0 references
\(\varepsilon\)-cuttings
0 references
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM (English)
0 references
