Propositional proofs and reductions between NP search problems (Q435190)

From MaRDI portal
Revision as of 11:33, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Propositional proofs and reductions between NP search problems
scientific article

    Statements

    title
    Propositional proofs and reductions between NP search problems (English)
    0 references
    author
    Samuel R. Buss
    0 references
    Alan S. Johnson
    0 references
    publication date
    11 July 2012
    0 references
    Mathematics Subject Classification ID
    03F07
    0 references
    03B05
    0 references
    03D15
    0 references
    03D30
    0 references
    03F20
    0 references
    68Q15
    0 references
    zbMATH DE Number
    6054355
    0 references
    zbMATH Keywords
    search problems
    0 references
    Nullstellensatz
    0 references
    propositional proofs
    0 references
    polynomial-time reducibility
    0 references
    OpenAlex ID
    W2065828765
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q435190&oldid=35288733"
    Powered by MediaWiki