A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034)

From MaRDI portal
Revision as of 21:48, 1 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127965335, #quickstatements; #temporary_batch_1722545075506)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7051403
Language Label Description Also known as
English
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
scientific article; zbMATH DE number 7051403

    Statements

    A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 May 2019
    0 references
    sum-of-squares
    0 references
    planted clique
    0 references
    lower bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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