On the parity complexity measures of Boolean functions (Q974756)

From MaRDI portal
Revision as of 22:07, 2 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 parity complexity measures of Boolean functions
scientific article

    Statements

    title
    On the parity complexity measures of Boolean functions (English)
    0 references
    author
    Yaoyun Shi
    0 references
    Zhi-Qiang Zhang
    0 references
    publication date
    7 June 2010
    0 references
    zbMATH DE Number
    5717743
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    communication complexity
    0 references
    parity decision tree
    0 references
    log-rank conjecture
    0 references
    OpenAlex ID
    W1609754208
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q974756&oldid=35173085"
    Powered by MediaWiki