Balancing syntactically multilinear arithmetic circuits. (English) Zbl 1188.68367

Raz, Ran; Yehudayoff, Amir

Comput. Complexity 17, No. 4, 515-535 (2008).

Summary: In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced. That is, they showed that for every arithmetic circuit \(\Phi\) of size \(s\) and degree \(r\), there exists an arithmetic circuit \(\Psi \) of size poly\((r, s)\) and depth \(O (\log (r) \log (s))\) computing the same polynomial. In the first part of this paper, we follow the proof of Valiant el al. and show that syntactically multilinear arithmetic circuits can be balanced. That is, we show that if \(\Phi\) is syntactically multilinear, then so is \(\Psi \).
Recently, a super-polynomial separation between multilinear arithmetic formula and circuit size was shown. In the second part of this paper, we use the result of the first part to simplify the proof of this separation. That is, we construct a (simpler) polynomial \(f (x _{1}, \dots , x _{n })\) such that every multilinear arithmetic formula computing \(f\) is of size \(n ^{\Omega (\log (n))}\) and there exists a syntactically multilinear arithmetic circuit of size poly\((n)\) and depth \(O(\log ^{2}(n))\) computing \(f\).

MSC:

68W30	Symbolic computation and algebraic computation
68Q25	Analysis of algorithms and problem complexity