Learning a hidden graph using \(O(\log n)\)queries per edge (Q927873)

From MaRDI portal
Revision as of 10:34, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Learning a hidden graph using \(O(\log n)\)queries per edge
scientific article

    Statements

    Learning a hidden graph using \(O(\log n)\)queries per edge (English)
    0 references
    0 references
    0 references
    10 June 2008
    0 references
    query learning
    0 references
    edge-detecting queries
    0 references
    graphs
    0 references
    hypergraphs
    0 references
    monotone DNF formulas
    0 references
    chemical reaction networks
    0 references

    Identifiers