Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (Q3586180)

From MaRDI portal
Revision as of 03:06, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
scientific article

    Statements

    title
    Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (English)
    0 references
    author
    Zeev Dvir
    0 references
    Amir Shpilka
    0 references
    Amir Yehudayoff
    0 references
    publication date
    6 September 2010
    0 references
    zbMATH Keywords
    polynomial identity testing
    0 references
    derandomization
    0 references
    polynomial factoring
    0 references
    hardness
    0 references
    randomness
    0 references

    Identifiers

    DOI
    10.1137/080735850
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    68W20
    0 references
    12Y05
    0 references
    zbMATH DE Number
    5779422
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3586180&oldid=16995858"
    Powered by MediaWiki