A complexity dichotomy for hypergraph partition functions (Q626694)

From MaRDI portal
Revision as of 00:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A complexity dichotomy for hypergraph partition functions
scientific article

    Statements

    title
    A complexity dichotomy for hypergraph partition functions (English)
    0 references
    author
    Martin Dyer
    0 references
    Leslie Ann Goldberg
    0 references
    Mark R. Jerrum
    0 references
    publication date
    18 February 2011
    0 references
    zbMATH Keywords
    complexity of counting homomorphisms
    0 references
    dichotomy theorem
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    08A70
    0 references
    68Q25
    0 references
    68R05
    0 references
    68R10
    0 references
    zbMATH DE Number
    5853297
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q626694&oldid=25689202"
    Powered by MediaWiki