Expected complexity of fast search with uniformly distributed data (Q1156487)
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: Expected complexity of fast search with uniformly distributed data |
scientific article; zbMATH DE number 3735150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Expected complexity of fast search with uniformly distributed data |
scientific article; zbMATH DE number 3735150 |
Statements
Expected complexity of fast search with uniformly distributed data (English)
0 references
1981
0 references
binary search
0 references
binomial distribution
0 references
data access
0 references
expected value
0 references
interpolation search
0 references
uniform distribution
0 references
