Deterministic and probabilistic binary search in graphs (Q5361858)

From MaRDI portal
Revision as of 01:27, 20 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 6784098
Language Label Description Also known as
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references