Solving \(k\)-SUM using few linear queries (Q4606294)
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: Solving k-SUM using few linear queries |
scientific article; zbMATH DE number 6846396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving \(k\)-SUM using few linear queries |
scientific article; zbMATH DE number 6846396 |
Statements
2 March 2018
0 references
\(k\)-SUM problem
0 references
linear decision trees
0 references
point location
0 references
\(\varepsilon\)-nets
0 references
Solving k-SUM using few linear queries (English)
0 references
0.8577885031700134
0 references
0.8518384695053101
0 references
0.8509825468063354
0 references
0.8462645411491394
0 references
0.8011021018028259
0 references
