Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700)

From MaRDI portal
Revision as of 20:03, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57255181, #quickstatements; #temporary_batch_1706897434465)
scientific article
Language Label Description Also known as
English
Maximum bounded 3-dimensional matching is MAX SNP-complete
scientific article

    Statements

    title
    Maximum bounded 3-dimensional matching is MAX SNP-complete (English)
    0 references
    author
    Viggo Kann
    0 references
    publication date
    1991
    0 references
    zbMATH Keywords
    approximation
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    MAX SNP- complete problems
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q15
    0 references
    90C27
    0 references
    03D15
    0 references
    zbMATH DE Number
    4170090
    0 references
    Wikidata QID
    Q57255181
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q922700&oldid=15044053"
    Powered by MediaWiki