On the automatizability of polynomial calculus (Q1959382)

From MaRDI portal
Revision as of 07:42, 3 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
On the automatizability of polynomial calculus
scientific article

    Statements

    title
    On the automatizability of polynomial calculus (English)
    0 references
    author
    Nicola Galesi
    0 references
    Massimo Lauria
    0 references
    publication date
    6 October 2010
    0 references
    Mathematics Subject Classification ID
    03B35
    0 references
    03F20
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5796561
    0 references
    zbMATH Keywords
    automatizability
    0 references
    polynomial calculus
    0 references
    proof complexity
    0 references
    degree lower bound
    0 references
    Wikidata QID
    Q61732588
    0 references
    OpenAlex ID
    W2153159703
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1959382&oldid=35191929"
    Powered by MediaWiki