A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits

2010
*
SIAM journal on computing (Print)
*

In this paper we show that lower bounds for bounded depth arithmetic circuits imply derandomization of polynomial identity testing for bounded depth arithmetic circuits. More formally, if there exists an explicit polynomial f (x 1 , . . . , x m ) that cannot be computed by a depth d arithmetic circuit of small size then there exists an efficient deterministic algorithm to test whether a given depth d − 8 circuit is identically zero or not (assuming the individual degrees of the tested circuit

doi:10.1137/080735850
fatcat:gonpk6xthzgdzldbrgsdqowlha