An almost optimal algorithm for unbounded search with noisy information (Q6544082)
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: An almost optimal algorithm for unbounded search with noisy information |
scientific article; zbMATH DE number 7853697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An almost optimal algorithm for unbounded search with noisy information |
scientific article; zbMATH DE number 7853697 |
Statements
An almost optimal algorithm for unbounded search with noisy information (English)
0 references
27 May 2024
0 references
fault-tolerant search
0 references
noisy binary search
0 references
query complexity
0 references
