Arithmetic Circuits: A Chasm at Depth Three

We show that, over Q, if an n-variate polynomial of degree d = n O(1) is computable by an arithmetic circuit of size s (respectively by an arithmetic branching program of size s) then it can also be computed by a depth three circuit (i. e. a ΣΠΣ-circuit) of size exp(O(√(d log n log d log s))) (respectively of size exp(O(√(d log n log s))). In particular this yields a ΣΠΣ circuit of size exp(O(√(d log d))) computing the d × d determinant Det d. It also means that if we can prove a lower bound of exp(omega(√(d log d))) on the size of any ΣΠΣ-circuit computing the d × d permanent Perm d then we get super polynomial lower bounds for the size of any arithmetic branching program computing Perm d. We then give some further results pertaining to derandomizing polynomial identity testing and circuit lower bounds. The ΣΠΣ circuits that we construct have the property that (some of) the intermediate polynomials have degree much higher than d. Indeed such a counterintuitive construction is unavoidable - it is known that in any ΣΠΣ circuit C computing either Det d or Perm_d, if every multiplication gate has fanin at most d (or any constant multiple thereof) then C must have size at least exp(Ω(d)).

Authors

• Ankit Gupta 0001
• Pritish Kamath
• Neeraj Kayal
• Ramprasad Saptharishi

Keywords

• Polynomials
• Logic gates
• Complexity theory
• Tensile stress
• Computer science
• Testing
• Arithmetic Circuits
• Lower Bound
• Variate
• Polynomial Of Degree
• Linear Form
• Intense Investigation
• Rest Of This Section
• Arithmetic Operations
• Degree Of Formation
• Circuit Size
• Multiple Gates
• depth reduction
• depth three circuits
• determinant
• permanent
• VP
• VNP