17 search results - page 1 / 4 » Derandomizing polynomial identity tests means proving circui... |
STOC
2003
ACM
14 years 4 months ago
2003
ACM
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
ECCC
2010
13 years 11 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...
FOCS
2008
IEEE
14 years 5 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...
CORR
2010
Springer
13 years 11 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 ...