Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

STOC
2003
ACM

favoriteEmaildiscussreport

85views Algorithms» more STOC 2003»

Derandomizing polynomial identity tests means proving circuit lower bounds

14 years 4 months ago

Derandomizing polynomial identity tests means proving circuit lower bounds

Download www.cs.montana.edu

Valentine Kabanets, Russell Impagliazzo

Real-time Traffic

Algorithms | STOC 2003 |

claim paper

Related Content

» On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors

» A note on circuit lower bounds from derandomization

» Arithmetic Circuits A Chasm at Depth Four

» Shallow Circuits with HighPowered Inputs

» Diagonal Circuit Identity Testing and Lower Bounds

» Checking Polynomial Identities over any Field Towards a Derandomization

» More on Noncommutative Polynomial Identity Testing

» Arithmetic circuits the chasm at depth four gets wider

» Efficient Learning Algorithms Yield Circuit Lower Bounds

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	STOC
Authors	Valentine Kabanets, Russell Impagliazzo

Comments (0)