Lower bounds for orthogonal range searching: I. The reporting case (Q3474276)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4141492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for orthogonal range searching: I. The reporting case |
scientific article; zbMATH DE number 4141492 |
Statements
Lower bounds for orthogonal range searching: I. The reporting case (English)
0 references
1990
0 references
lower bounds
0 references
complexity
0 references
pointer machine
0 references
0.9202739596366882
0 references
0.8843561410903931
0 references
0.877466082572937
0 references
0.8760043382644653
0 references
0.8739537596702576
0 references
