Prefix search with a lie (Q1102755): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0097-3165(88)90003-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2020823718 / rank | |||
Normal rank | |||
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