Arithmetic circuits: A chasm at depth four

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 67-75

  Agrawal, Manindra ^a   Vinay, V ^b,c  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b Geodesic Information Systems Ltd   (India)

^c CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; LOGIC CIRCUITS;

ARITHMETIC CIRCUITS; BLACK BOXES; DERANDOMIZATION; LOWER BOUNDS;

INTEGRATING CIRCUITS;

EID: 58049118510     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.32     Document Type: Conference Paper

References (25)

1. M. Agrawal. Proving lower bounds via pesudo-random generators. In Proceedings of the FST&TCS, pages 96-105, 2005.
2. E. Allender, J. Jiao, M. Mahajan, and V Vinay. Non-commutative arithmetic circuits: Depth reduction and size lower bounds. Theoretical Computer Science, 209:47-86, 1998.
3. S. A. Cook. A Taxonomy of Problems with Fast Parallel Algorithms. Information and Control 64(1-3):2-21, 1985.
4. #l. Technical Report Informatik-preprint 8, Fachbereich Informatik der Humboldt Universität zu Berlin, 1991.
5. Z. Dvir, A. Shpilka, A. Yehudayoff. Hardness-randomness tradeoffs for bounded depth arithmetic circuits. In Symposium of Theory of Computing 741-748, 2008.
6. D. Grigoriev and A. Razborov. An Exponential Lower Bound for Depth 3 Arithmetic Circuits. In Symposium on Theory of Computing 577-582, 1998.
7. D. Grigoriev and A. Razborov. Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. Applicable Algebra in Engineering, Communication and Computing, 10(6):467-487, 2000.
8. M. Jerrum and M. Snir. Some exact complexity results for straight-line computations over semirings. J. ACM, 29(3):874-897, 1982.
9. Valentine Kabanets and Russell Impagliazzo. Derandomizing polyonmial identity tests means proving circuit lower bounds. Computational Complexity, 13:1-46, 2004.
10. E. Kaltofen. Factorization of polynomials given by straight-line programs. In S. Micali, editor, Randomness and Computation, 375-412. JAI Press, 1989. Volume 5 of Advances in Computing Research.
11. Z. S. Karnin, A. Shpilka. Black Box Polynomial Identity Testing of Generalized Depth3 Arithmetic Circuits with Bounded Top Fan-In. In IEEE Conference on Computational Complexity 280-291, 2008.
12. Neeraj Kayal and Nitin Saxena. Polynomial identity testing for depth 3 circuits. Computational Complexity, 16(2):115-138, 2007.
13. N. Nisan and A. Wigderson. Hardness vs. randomness. J. Comput. Sys. Sci., 49(2):149-167, 1994.
14. N. Nisan and A. Wigderon. Lower bounds on arithmetic circuits via partial derivatives. Computational Complexity, 6:217-234, 1996.
15. Ran Raz. Multi-linear formulas for permanent and determinant and of superpolynomial size. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 633-641, 2004.
16. Ran Raz, Amir Yehudayoff. Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. ECCC TR07-085, 2007.
17. Nitin Saxena. Diagonal Circuit Identity Testing and Lower Bounds. In Proceedings of the International Colloquium on Automata, Languages and Programming, LNCS 5125, pages 60-71, 2008.
18. A. Shpilka and A. Wigderson. Depth-3 arithmetic formulae over fields of characteristic zero. In Proceedings of the Conference on Computational Complexity, pages 79-96, 1999.
19. S. Toda. Counting problems computationally equivalent to the determinant. manuscript, 1991.
20. L. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. Fast parallel computation of polynnomials using few processors. SIAM Journal on Computing, 12:641-644, 1983.
21. L. G. Valiant. Why is Boolean Complexity Theory Difficult? In Proceedings of Annual ACMSymposium on the Theory of Computing, pages 249-261, 1979.
22. L. G. Valiant. The Complexity of Computing the Permanent. Theor. Comput. Sci., 8:189-201, 1979.
23. L. G. Valiant. Negation can be exponentially powerful. Theor. Comput. Sci., 12:303-314, 1980.
24. L. G. Valiant. Exponential Lower Bounds for Restricted Monotone Circuits. In Symposium on Theory of Computing, 110-117, 1983.
25. V Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In IEEE Proceedings of the Structure in Complexity Theory Conference, pages 270-284. 1991.