Natural Proofs versus Derandomization (Q2805512)

From MaRDI portal
Revision as of 19:39, 16 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Natural Proofs versus Derandomization
scientific article

    Statements

    title
    Natural Proofs versus Derandomization (English)
    0 references
    author
    R. Ryan Williams
    0 references
    publication date
    12 May 2016
    0 references
    zbMATH Keywords
    circuit complexity
    0 references
    natural proofs
    0 references
    derandomization
    0 references
    randomized computation
    0 references
    nondeterminism
    0 references
    ACC
    0 references

    Identifiers

    DOI
    10.1137/130938219
    0 references
    Mathematics Subject Classification ID
    68Q15
    0 references
    03F20
    0 references
    68Q17
    0 references
    94C10
    0 references
    zbMATH DE Number
    6579501
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2805512&oldid=3131942"
      Powered by MediaWiki