Average complexity of searching for identical objects in random nonuniform databases (Q2889732)
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: Average complexity of searching for identical objects in random nonuniform databases |
scientific article; zbMATH DE number 6043772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average complexity of searching for identical objects in random nonuniform databases |
scientific article; zbMATH DE number 6043772 |
Statements
Average complexity of searching for identical objects in random nonuniform databases (English)
0 references
8 June 2012
0 references
average complexity of optimal algorithms
0 references
0.8050954341888428
0 references
0.7243906855583191
0 references
0.720477819442749
0 references
