A complexity dichotomy for hypergraph partition functions (Q626694)

From MaRDI portal
Revision as of 04:18, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A complexity dichotomy for hypergraph partition functions
scientific article

    Statements

    A complexity dichotomy for hypergraph partition functions (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2011
    0 references
    complexity of counting homomorphisms
    0 references
    dichotomy theorem
    0 references

    Identifiers

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