Uniform Derandomization from Pathetic Lower Bounds

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

• Type: Conference
• Year: 2010
• Where: APPROX
• Authors: Eric Allender, Vikraman Arvind, Fengming Wang
• Keywords: Algorithms, APPROX 2010, Lower Bounds, Size Lower Bounds, Threshold Circuits