The complexity of two problems on arithmetic circuits (Q2465637)

From MaRDI portal
Revision as of 14:44, 27 June 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
The complexity of two problems on arithmetic circuits
scientific article

    Statements

    title
    The complexity of two problems on arithmetic circuits (English)
    0 references
    author
    Pascal Koiran
    0 references
    Sylvain Perifel
    0 references
    publication date
    7 January 2008
    0 references
    Mathematics Subject Classification ID
    68W05
    0 references
    68W30
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5223680
    0 references
    zbMATH Keywords
    arithmetic circuits
    0 references
    polynomials
    0 references
    counting classes
    0 references
    algorithms
    0 references
    OpenAlex ID
    W2053392671
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2465637&oldid=35025237"
    Powered by MediaWiki