The Complexity of DNF of Parities (Q2800552)

From MaRDI portal
Revision as of 18:46, 19 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 DNF of Parities
scientific article

    Statements

    title
    The Complexity of DNF of Parities (English)
    0 references
    author
    Gil Cohen
    0 references
    Igor Shinkar
    0 references
    publication date
    15 April 2016
    0 references
    zbMATH Keywords
    affine disperser
    0 references
    affine extractors
    0 references
    DNF
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q05
    0 references
    68Q25
    0 references
    94C10
    0 references
    zbMATH DE Number
    6569685
    0 references
    OpenAlex ID
    W2282923620
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2800552&oldid=31391161"
    Powered by MediaWiki