The Monotone Complexity of $k$-Clique on Random Graphs (Q5419039)

From MaRDI portal
Revision as of 05:01, 24 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6300925
Language Label Description Also known as
English
The Monotone Complexity of $k$-Clique on Random Graphs
scientific article; zbMATH DE number 6300925

    Statements

    The Monotone Complexity of $k$-Clique on Random Graphs (English)
    0 references
    0 references
    4 June 2014
    0 references
    monotone circuit
    0 references
    clique
    0 references
    random graphs
    0 references
    average-case complexity
    0 references
    quasi-sunflowers
    0 references

    Identifiers

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