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

From MaRDI portal
Revision as of 13:49, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(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

    The Complexity of Perfect Matching Problems on Dense Hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    17 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references