Sciweavers

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

14

APPROX
2010
Springer

favoriteEmaildiscussreport

120views Algorithms» more APPROX 2010»

Uniform Derandomization from Pathetic Lower Bounds

13 years 6 months ago

Uniform Derandomization from Pathetic Lower Bounds

Download www.cs.rutgers.edu

A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., superpolynomial, or even nearly-exponential) circuit size lower bounds for certain problems. In contrast to what is needed for derandomization, existing lower bounds seem rather pathetic (linear-size lower bounds for general circuits [IM02], nearly cubic lower bounds for formula size [H

Eric Allender, Vikraman Arvind, Fengming Wang

Real-time Traffic

Algorithms | APPROX 2010 | Lower Bounds | Size Lower Bounds | Threshold Circuits |

claim paper

Related Content

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

» Hardness Hypotheses Derandomization and Circuit Complexity

» A note on circuit lower bounds from derandomization

» Efficient Learning Algorithms Yield Circuit Lower Bounds

» NearOptimal Conversion of Hardness into PseudoRandomness

» Shallow Circuits with HighPowered Inputs

» New Constraints on Generation of Uniform Random Samples from Evolutionary Trees

» Extractors and Lower Bounds for Locally Samplable Sources

» Geometric lower bounds for parametric matroid optimization

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	APPROX
Authors	Eric Allender, Vikraman Arvind, Fengming Wang

Comments (0)