Sciweavers

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

14

ECCC
2010

favoriteEmaildiscussreport

90views more ECCC 2010»

A note on circuit lower bounds from derandomization

13 years 4 months ago

A note on circuit lower bounds from derandomization

Download pages.cs.wisc.edu

We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales better, and yields a somewhat stronger result than the original argument.

Scott Aaronson, Dieter van Melkebeek

Real-time Traffic

Alternate Proof | Circuit Lower Bounds | ECCC 2010 | Polynomial Identity |

claim paper

Related Content

» A note on exponential circuit lower bounds from derandomizing ArthurMerlin games

» Uniform Derandomization from Pathetic Lower Bounds

» Shallow Circuits with HighPowered Inputs

» Arithmetic Circuits A Chasm at Depth Four

» Derandomizing polynomial identity tests means proving circuit lower bounds

» Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

» Pseudorandom Generators TypicallyCorrect Derandomization and Circuit Lower Bounds

» Efficient Learning Algorithms Yield Circuit Lower Bounds

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

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ECCC
Authors	Scott Aaronson, Dieter van Melkebeek

Comments (0)