The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395)

From MaRDI portal
Revision as of 19:55, 26 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7410694
Language Label Description Also known as
English
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
scientific article; zbMATH DE number 7410694

    Statements

    The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2021
    0 references
    average-case complexity
    0 references
    fine-grained complexity
    0 references
    worst-case-to-average-case reductions
    0 references
    graph algorithms
    0 references
    random graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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