Balancing syntactically multilinear arithmetic circuits

Computational Complexity

Volumn 17, Issue 4, 2008, Pages 515-535

  Raz, Ran ^a   Yehudayoff, Amir ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Arithmetic circuits; Separation of circuit and formula size

Indexed keywords

EID: 57349190039     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-008-0254-0     Document Type: Article

References (6)

1. L. HYAPIL (1979). On the parallel evaluation of multivariate polynomials. SIAM Journal on Computing 8(2), 120-123. URL http://link.aip.org/link/?SMJ/8/120/1.
2. N. NISAN & A. WIGDERSON (1997). Lower bounds on arithmetic circuits via partial derivatives. Comput. Complex. 6(3), 217-234. ISSN 1016-3328.
3. R. RAZ (2004). Multi-linear formulas for permanent and determinant are of superpolynomial size. In Proceedings of the Thirty-sixth Annual ACM Symposium on the Theory of Computing, 633-641. ACM, New York, NY, USA. ISBN 1-58113-852-0.
4. R. RAZ (2006). Separation of multilinear circuit and formula size. Theory of Computing 2(6), 121-135. URL http://www. theoryofcomputing.org/articles/main/ v002/a006.
5. R. RAZ, A. SHPILKA & A. YEHUDAYOFF (2007). A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 438-448. IEEE Computer Society, Washington, DC, USA.
6. L. G. VALIANT, S. SKYUM, S. BERKOWITZ & C. RACKOFF (1983). Fast parallel computation of polynomials using few processors. SIAM Journal on Computing 12(4), 641-644. URL http://link.aip.org/link/?SMJ/12/641/1.