Prefix search with a lie (Q1102755)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4051019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Prefix search with a lie |
scientific article; zbMATH DE number 4051019 |
Statements
Prefix search with a lie (English)
0 references
1988
0 references
We investigate the problem of finding an unknown leaf in a full binary tree, allowing the questioner to ask only queries whether the hidden leaf is in a given full subtree and assuming that one of the opponent's answers may be erroneous. We give the worst-case minimal number of queries sufficient to perform this search and provide an optimal algorithm.
0 references
full binary tree
0 references
0.8010615706443787
0 references
0.7929190993309021
0 references
0.7851793169975281
0 references
0.7741070985794067
0 references
