Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing
We make progress towards proving an equivalence between the problem of derandomization,. tion of arithmetic circuit identity testing (ACIT), and the arithmetic circuit complexity the permanent defined by per(n) =Sigma(sigma is an element of Sn) Pi(n)(i=1) x(i sigma(i)) .We develop an ACIT-based derandomization hypothesis, and show this is a necessary condition for proving that permanent has super-polynomial arithmetic circuits over fields of characteristic zero. Informally, this hypothesis poses the existence of a subexponential size hitting set computable by subexponential size uniform TC0 circuits against size n arithmetic circuits with multilinear output. Assuming the Generalized Riemann Hypothesis (GRH), we show that this hypothesis is sufficient for proving that either permanent does not have polynomial size (nonuniform) arithmetic circuits, or that the Boolean circuit class uniform TC is strictly contained in uniform NC2. (C) 2012 Elsevier B.V. All rights reserved.
permanent arithmetic circuits derandomization computational complexity lower bounds polynomial identity testing