Sciweavers

Share
CC
2008
Springer

Balancing Syntactically Multilinear Arithmetic Circuits

8 years 2 months ago
Balancing Syntactically Multilinear Arithmetic Circuits
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of size s and degree r, there exists an arithmetic circuit 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 [VSBR] and show that syntactically multilinear arithmetic circuits can be balanced. That is, we show that if is syntactically multilinear, then so is . Recently, [R04b] proved a super-polynomial separation between multilinear arithmetic formula and circuit size. 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(x1, . . . , xn) such that
Ran Raz, Amir Yehudayoff
Added 24 Dec 2010
Updated 24 Dec 2010
Type Journal
Year 2008
Where CC
Authors Ran Raz, Amir Yehudayoff
Comments (0)
books