Prefix search with a lie (Q1102755): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Solution of Ulam's problem on searching with a lie / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coping with known patterns of lies in a search game / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coping with errors in binary search procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Guess a Number-with Lying / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4121861 / rank | |||
Normal rank | |||
Latest revision as of 17:16, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Prefix search with a lie |
scientific article |
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
