More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case (Q3204043)
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: More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case |
scientific article; zbMATH DE number 4180800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case |
scientific article; zbMATH DE number 4180800 |
Statements
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case (English)
0 references
1991
0 references
unbounded search
0 references
optimal algorithms
0 references
Kraft's inequality
0 references
Ackermann's function
0 references
prefix-free
0 references
0.8965024948120117
0 references
0.8264193534851074
0 references
0.7958828210830688
0 references
0.78946852684021
0 references
0.7774650454521179
0 references
