Statistical Algorithms and a Lower Bound for Detecting Planted Cliques (Q4640281)

From MaRDI portal
Revision as of 01:04, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6869318
Language Label Description Also known as
English
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
scientific article; zbMATH DE number 6869318

    Statements

    Statistical Algorithms and a Lower Bound for Detecting Planted Cliques (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    learning theory
    0 references
    lower bounds
    0 references
    planted clique
    0 references
    statistical algorithms
    0 references
    statistical dimension
    0 references