Proof verification and the hardness of approximation problems (Q3158513)

From MaRDI portal
Revision as of 00:54, 24 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q55872309, #quickstatements; #temporary_batch_1711234560214)
scientific article
Language Label Description Also known as
English
Proof verification and the hardness of approximation problems
scientific article

    Statements

    title
    Proof verification and the hardness of approximation problems (English)
    0 references
    author
    Sanjeev Arora
    0 references
    Madhu Sudan
    0 references
    Mario Szegedy
    0 references
    Carstent Lund
    0 references
    Rajeev Motwani
    0 references
    publication date
    25 January 2005
    0 references

    Identifiers

    DOI
    10.1145/278298.278306
    0 references
    Mathematics Subject Classification ID
    68Q15
    0 references
    03B35
    0 references
    03D15
    0 references
    68Q25
    0 references
    zbMATH DE Number
    2131007
    0 references
    OpenAlex ID
    W2148352980
    0 references
    Wikidata QID
    Q55872309
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3158513&oldid=33194751"
    Powered by MediaWiki