The complexity of Boolean functions in different characteristics (Q626677)

From MaRDI portal
Revision as of 00:36, 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
The complexity of Boolean functions in different characteristics
scientific article

    Statements

    title
    The complexity of Boolean functions in different characteristics (English)
    0 references
    author
    Parikshit Gopalan
    0 references
    Shachar Lovett
    0 references
    Amir Shpilka
    0 references
    publication date
    18 February 2011
    0 references
    zbMATH Keywords
    Representations of Boolean functions
    0 references
    polynomials
    0 references
    complexity
    0 references
    lower bounds
    0 references

    Identifiers

    zbMATH DE Number
    5853285
    0 references
    OpenAlex ID
    W2158501005
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q626677&oldid=32621580"
    Powered by MediaWiki