P, NP, and NP-Completeness (Q3066266)

From MaRDI portal
scientific article
Language Label Description Also known as
English
P, NP, and NP-Completeness
scientific article

    Statements

    title
    P, NP, and NP-Completeness (English)
    0 references
    author
    Oded Goldreich
    0 references
    publication date
    10 January 2011
    0 references
    Mathematics Subject Classification ID
    68-01
    0 references
    68Q15
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5834205
    0 references
    zbMATH Keywords
    NP-computability
    0 references
    NP-completeness
    0 references
    P versus NP
    0 references
    polynomial time checking
    0 references
    polynomial time computation
    0 references
    polynomial time find
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3066266&oldid=27459616"
    Powered by MediaWiki