Statistical algorithms and a lower bound for detecting planted cliques (Q5495836)

From MaRDI portal
Revision as of 22:03, 28 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6327000
Language Label Description Also known as
English
Statistical algorithms and a lower bound for detecting planted cliques
scientific article; zbMATH DE number 6327000

    Statements

    Statistical algorithms and a lower bound for detecting planted cliques (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 August 2014
    0 references
    0 references
    lower bounds
    0 references
    planted clique
    0 references
    statistical algorithms
    0 references
    statistical query
    0 references