Deterministic and probabilistic binary search in graphs (Q5361858)
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 6784098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic and probabilistic binary search in graphs |
scientific article; zbMATH DE number 6784098 |
Statements
Deterministic and probabilistic binary search in graphs (English)
0 references
29 September 2017
0 references
exponential-time hypothesis
0 references
noisy binary search
0 references
PSPACE-hardness
0 references
quasipolynomial-time algorithms
0 references
searching in metric spaces
0 references
0.870058536529541
0 references
0.8669527769088745
0 references
0.7839406132698059
0 references
0.7678242325782776
0 references
0.7644004821777344
0 references
