The relative complexity of NP search problems (Q1273858)

From MaRDI portal
Revision as of 22:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The relative complexity of NP search problems
scientific article

    Statements

    title
    The relative complexity of NP search problems (English)
    0 references
    author
    Jeff Edmonds
    0 references
    Russell Impagliazzo
    0 references
    Toniann Pitassi
    0 references
    P. W. Beame
    0 references
    Stephen A. Cook
    0 references
    publication date
    13 September 1999
    0 references
    zbMATH Keywords
    NP search problems
    0 references

    Identifiers

    zbMATH DE Number
    1236446
    0 references
    OpenAlex ID
    W2037028865
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1273858&oldid=32096186"
    Powered by MediaWiki