Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374)
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: Minimum average-case queries of q+1-ary search game with small sets |
scientific article; zbMATH DE number 6030400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum average-case queries of \(q+1\)-ary search game with small sets |
scientific article; zbMATH DE number 6030400 |
Statements
Minimum average-case queries of \(q+1\)-ary search game with small sets (English)
0 references
4 May 2012
0 references
search game
0 references
sequential algorithm
0 references
average-cost
0 references
Huffman tree
0 references
0.7765239477157593
0 references
0.7762677073478699
0 references
0.764402449131012
0 references
0.7504041194915771
0 references
