Sciweavers

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

97

Voted

APPROX
2008
Springer

79views Algorithms» more APPROX 2008»

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

15 years 5 months ago

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

Download www.imsc.res.in

Vikraman Arvind, Partha Mukhopadhyay

Real-time Traffic

Algorithms | APPROX 2008 |

claim paper

Related Content

» Uniform Derandomization from Pathetic Lower Bounds

» Arithmetic Circuits A Chasm at Depth Four

» NearOptimal Conversion of Hardness into PseudoRandomness

» Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates

» Arithmetic circuits the chasm at depth four gets wider

» Discrepancy and the Power of Bottom Fanin in Depththree Circuits

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	APPROX
Authors	Vikraman Arvind, Partha Mukhopadhyay

Comments (0)