Lower Bounds on the Complexity of Polytope Range Searching (Q3471697)
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: Lower Bounds on the Complexity of Polytope Range Searching |
scientific article; zbMATH DE number 4139286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower Bounds on the Complexity of Polytope Range Searching |
scientific article; zbMATH DE number 4139286 |
Statements
1989
0 references
polytope range searching
0 references
lower bounds
0 references
complexity
0 references
Ramsey theory
0 references
Lower Bounds on the Complexity of Polytope Range Searching (English)
0 references
0.8574072122573853
0 references
0.845920979976654
0 references
0.8454635143280029
0 references
0.8439859747886658
0 references
0.8433889746665955
0 references
