Complexity of propositional proofs under a promise (Q2946606)

From MaRDI portal
Revision as of 21:16, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Complexity of propositional proofs under a promise
scientific article

    Statements

    title
    Complexity of propositional proofs under a promise (English)
    0 references
    author
    Nachum Dershowitz
    0 references
    Iddo Tzameret
    0 references
    publication date
    17 September 2015
    0 references
    zbMATH Keywords
    promise problems
    0 references
    propositional proof complexity
    0 references
    random 3CNF
    0 references
    resolution
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03F20
    0 references
    03B05
    0 references
    94C10
    0 references
    zbMATH DE Number
    6483114
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2946606&oldid=15935267"
    Powered by MediaWiki