Circuit Complexity and Multiplicative Complexity of Boolean Functions (Q3576211)

From MaRDI portal
Revision as of 02:19, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    author
    Arist Kojevnikov
    0 references
    Alexander S. Kulikov
    0 references

    Identifiers

    zbMATH DE Number
    5762752
    0 references
    OpenAlex ID
    W1481719945
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3576211&oldid=32969779"
    Powered by MediaWiki