Circuit Complexity and Multiplicative Complexity of Boolean Functions (Q3576211)

From MaRDI portal
Revision as of 13:55, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Circuit Complexity and Multiplicative Complexity of Boolean Functions
scientific article

    Statements

    title
    Circuit Complexity and Multiplicative Complexity of Boolean Functions (English)
    0 references
    publication date
    29 July 2010
    0 references
    zbMATH DE Number
    5762752
    0 references
    author
    Arist Kojevnikov
    0 references
    Alexander S. Kulikov
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3576211&oldid=28093590"
    Powered by MediaWiki