Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630)

From MaRDI portal
Revision as of 03:53, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q806675)
scientific article
Language Label Description Also known as
English
Computing the Partition Function for Perfect Matchings in a Hypergraph
scientific article

    Statements

    title
    Computing the Partition Function for Perfect Matchings in a Hypergraph (English)
    0 references
    author
    Alex Samorodnitsky
    0 references
    publication date
    8 December 2011
    0 references
    zbMATH Keywords
    nearly perfect matchings in hypergraphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C70
    0 references
    05C65
    0 references
    05C85
    0 references
    zbMATH DE Number
    5987527
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3103630&oldid=22097423"
    Powered by MediaWiki