The Complexity of Rationalizing Matchings (Q3596716)

From MaRDI portal
Revision as of 10:19, 16 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 Rationalizing Matchings
scientific article

    Statements

    title
    The Complexity of Rationalizing Matchings (English)
    0 references
    author
    Shankar Kalyanaraman
    0 references
    Christopher Umans
    0 references
    publication date
    29 January 2009
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68W25
    0 references
    91B68
    0 references
    zbMATH DE Number
    5500009
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3596716&oldid=8024679"
      Powered by MediaWiki