85 search results - page 1 / 17 » A note on circuit lower bounds from derandomization |
ECCC
2010
12 years 11 months ago
2010
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
ECCC
2010
13 years 5 months ago
2010
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 b...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
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., s...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...