The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees (Q3409858)
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 5074238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees |
scientific article; zbMATH DE number 5074238 |
Statements
20 November 2006
0 references
The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees (English)
0 references
0.8676114678382874
0 references
0.730603039264679
0 references
0.7262417078018188
0 references
0.7184966802597046
0 references
0.7174151539802551
0 references
