A nearly quadratic bound for the decision tree complexity of \(k\)-SUM (Q4580116)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A nearly quadratic bound for the decision tree complexity of k-SUM |
scientific article; zbMATH DE number 6917060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8577885031700134
0 references
0.8548606634140015
0 references
0.8528271317481995
0 references
0.8266279697418213
0 references
0.8240385055541992
0 references
