Propositional proofs and reductions between NP search problems (Q435190)

From MaRDI portal
Revision as of 21:59, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    zbMATH Keywords
    search problems
    0 references
    Nullstellensatz
    0 references
    propositional proofs
    0 references
    polynomial-time reducibility
    0 references

    Identifiers

    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
    OpenAlex ID
    W2065828765
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q435190&oldid=32084405"
    Powered by MediaWiki