Space Complexity in Polynomial Calculus (Q2944568)

From MaRDI portal
Revision as of 21:50, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Space Complexity in Polynomial Calculus
scientific article

    Statements

    title
    Space Complexity in Polynomial Calculus (English)
    0 references
    author
    Yuval Filmus
    0 references
    Massimo Lauria
    0 references
    Jakob Nordström
    0 references
    Noga Ron-Zewi
    0 references
    Neil Thapen
    0 references
    publication date
    2 September 2015
    0 references
    zbMATH Keywords
    proof complexity
    0 references
    space
    0 references
    polynomial calculus
    0 references
    polynomial calculus resolution
    0 references
    PCR
    0 references
    resolution
    0 references
    lower bounds
    0 references
    describes a project that uses
    Chaff
    0 references
    PolyBoRi
    0 references

    Identifiers

    DOI
    10.1137/120895950
    0 references
    Mathematics Subject Classification ID
    03F20
    0 references
    68Q17
    0 references
    03B35
    0 references
    03B05
    0 references
    03D15
    0 references
    03B70
    0 references
    68T15
    0 references
    zbMATH DE Number
    6477904
    0 references
    Wikidata QID
    Q61732581
    0 references
    OpenAlex ID
    W1944379106
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2944568&oldid=32052718"
    Powered by MediaWiki