Lower bounds and sparations for constant depth multilinear circuits

Computational Complexity

Volumn 18, Issue 2, 2009, Pages 171-207

  Raz, Ran ^a   Yehudayoff, Amir ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Arithmetic circuits; Constant depth circuits; Separations

Indexed keywords

EID: 68149161338     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-009-0270-8     Document Type: Conference Paper

References (16)

1. 1 formulae on finite structures. Annals of Pure and Applied Logic 24, 1-48.
2. L. FURST, J. B. SAXE & M. SIPSER (1987). Parity, circuits, and the polynomialtime hierarchy. Mathematical Systems Theory 17(1), 13-27.
3. GRIGORIEV & M. KARPINSKI (1998). An exponential lower bound for depth 3 arithmetic circuits. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, 577-582. ACM, New York, NY, USA. ISBN 0-89791-962-9.
4. GRIGORIEV & A. A. RAZBOROV (2000). Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. Appl. Algebra Eng. Commun. Comput. 10(6), 465-487.
5. J. HÅSTAD (1987). Computational Limitations of Small-depth Circuits. MIT Press, Cambridge, MA, USA. ISBN 0262081679.
6. N. NLSAN & A. WIGDERSON (1997). Lower bounds on arithmetic circuits via partial derivatives. Comput. Complex. 6(3), 217-234. ISSN 1016-3328.
7. R. RAZ (2004). Multi-linear formulas for permanent and determinant are of superpolynomial size. In STOC '04: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, 633-641. ACM, New York, NY, USA. ISBN 1-58113-852-0.
8. R. RAZ (2006). Separation of multilinear circuit and formula size. Theory of Computing 2(1), 121-135. URL http ://www.theoryofcomputing.org/articles/main/ v002/a006.
9. R. RAZ (2008). Elusive functions and lower bounds for arithmetic circuits. In STOC '08: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 711-720. ACM, New York, NY, USA. ISBN 978-1-60558-047-0.
10. R. RAZ, A. SHPILKA & A. YEHUDAYOPF (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. ISBN 0-7695-3010-9.
11. R. RAZ & A. YEHUDAYOFF (2008). Balancing syntactically multilinear arithmetic circuits. Comput. Complex.. 17(4), 515-535. ISSN 1016-3328.
12. A. RAZBOROV (1987). Lower bounds for the size of circuits of bounded depth with basis {⊕, ∧}. Math. Notes of the Academy of Sciences of the USSR 41, 333-338.
13. SHOUP & R. SMOLENSKY (1991). Lower bounds for polynomial evaluation and interpolation problems. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 378-383. IEEE Computer Society Press, Los Alamitos, CA, USA. ISBN 0-8186-2445-0.
14. A. SHPILKA & A. WLGDERSON (1999). Depth-3 arithmetic formulae over fields of characteristic zero. In Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, 87. IEEE Computer Society, Washington, DC, USA. ISBN 0-7695-0075-7.
15. R. SMOLENSKY (1987). Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In STOC '87: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 77-82. ACM, New York, NY, USA. ISBN 0-89791-221-7.
16. A. C.-C. YAO (1985). Separating the polynomial-time hierarchy by oracles. In Proc. 26th Annual Symposium on Foundations of Computer Science, 1-10. IEEE Press, Piscataway, NJ, USA. ISBN 0-8186-0644-4.