Space Complexity in Propositional Calculus (Q3149864)

From MaRDI portal
Revision as of 10:55, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Space Complexity in Propositional Calculus
scientific article

    Statements

    title
    Space Complexity in Propositional Calculus (English)
    0 references
    author
    Michael Alekhnovich
    0 references
    Eli Ben-Sasson
    0 references
    Avi Wigderson
    0 references
    Alexander A. Razborov
    0 references
    publication date
    29 September 2002
    0 references
    Mathematics Subject Classification ID
    03F20
    0 references
    03B35
    0 references
    03B05
    0 references
    03D15
    0 references
    zbMATH DE Number
    1808472
    0 references
    zbMATH Keywords
    proof complexity
    0 references
    resolution
    0 references
    Frege systems
    0 references
    polynomial calculus
    0 references
    space complexity
    0 references
    upper bounds
    0 references
    lower bounds
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3149864&oldid=27530680"
    Powered by MediaWiki