The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249)

From MaRDI portal
Revision as of 14:36, 2 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57255182, #quickstatements; #temporary_batch_1714653054045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of Perfect Matching Problems on Dense Hypergraphs
scientific article

    Statements

    title
    The Complexity of Perfect Matching Problems on Dense Hypergraphs (English)
    0 references
    author
    Andrzej Ruciński
    0 references
    Edyta Szymańska
    0 references
    Marek Karpinski
    0 references
    publication date
    17 December 2009
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C65
    0 references
    05C70
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5649415
    0 references
    OpenAlex ID
    W1603859152
    0 references
    Wikidata QID
    Q57255182
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3652249&oldid=34056946"
    Powered by MediaWiki