More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case (Q3204044): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0220011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3175046490 / rank | |||
Normal rank | |||
Latest revision as of 22:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case |
scientific article |
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
