More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case (Q3204044)
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, II:The Transfinite Case |
scientific article; zbMATH DE number 4180801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case |
scientific article; zbMATH DE number 4180801 |
Statements
More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case (English)
0 references
1991
0 references
unbounded search
0 references
prefix-free codes
0 references
optimal algorithms
0 references
Kraft's inequality
0 references
ordinal numbers
0 references
Grzegorczyk hierarchy
0 references
Ackermann's function
0 references
0.9705226
0 references
0 references
0.8519941
0 references
0.8497851
0 references
0 references
0.8399468
0 references
0.8365305
0 references
0.8362765
0 references
