On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant

Abstract

We consider the problem of fixed-polynomial lower bounds on the size of arithmetic circuits computing uniform families of polynomials. Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in MA having no arithmetic circuits of size O(n ^k) over ℂ (allowing any complex constant). We also build a family of polynomials that can be evaluated in AM having no arithmetic circuits of size O(n ^k). Then we investigate the link between fixed-polynomial size circuit bounds in the Boolean and arithmetic settings. In characteristic zero, it is proved that NP $\not\subset$ size(n ^k), or MA ⊂ size(n ^k), or NP = MA imply lower bounds on the circuit size of uniform polynomials in n variables from the class VNP over ℂ, assuming GRH. In positive characteristic p, uniform polynomials in VNP have circuits of fixed-polynomial size if and only if both VP = VNP over $\mathbb{F}_p$ and Mod _p P has circuits of fixed-polynomial size.