Hardness hypotheses, derandomization, and circuit complexity (Q937197)

From MaRDI portal
Revision as of 01:40, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Hardness hypotheses, derandomization, and circuit complexity
scientific article

    Statements

    title
    Hardness hypotheses, derandomization, and circuit complexity (English)
    0 references
    author
    John M. Hitchcock
    0 references
    A. Pavan
    0 references
    publication date
    20 August 2008
    0 references
    zbMATH Keywords
    Circuit complexity
    0 references
    derandomization
    0 references
    resource-bounded measure and scaled dimension
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q15
    0 references
    68Q17
    0 references
    68Q30
    0 references
    zbMATH DE Number
    5314389
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q937197&oldid=25881749"
    Powered by MediaWiki