The complexity of polynomial-time approximation (Q2464331)

From MaRDI portal
Revision as of 23:02, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57359962, #quickstatements; #temporary_batch_1706897434465)
scientific article
Language Label Description Also known as
English
The complexity of polynomial-time approximation
scientific article

    Statements

    title
    The complexity of polynomial-time approximation (English)
    0 references
    author
    Li-Ming Cai
    0 references
    Michael R. Fellows
    0 references
    David W. Juedes
    0 references
    Frances A. Rosamond
    0 references
    publication date
    19 December 2007
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    68Q15
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5221846
    0 references
    Wikidata QID
    Q57359962
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2464331&oldid=15098471"
      Powered by MediaWiki