Max NP-completeness made easy (Q1960655)

From MaRDI portal
Revision as of 20:14, 29 July 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
Max NP-completeness made easy
scientific article

    Statements

    title
    Max NP-completeness made easy (English)
    0 references
    author
    Pierluigi Crescenzi
    0 references
    Luca Trevisan
    0 references
    publication date
    12 January 2000
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    approximation preserving reductions
    0 references
    class Max NP
    0 references
    probabilistic method
    0 references

    Identifiers

    zbMATH DE Number
    1387543
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1960655&oldid=2280776"
      Powered by MediaWiki