Lower bounds for matrix product in bounded depth circuits with arbitrary gates

SIAM Journal on Computing

Volumn 32, Issue 2, 2003, Pages 488-513

  Raz, Ran ^a   Sphlika, Amir ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b Maxwell Dworkin 140 ^*  (United States)

Author keywords

Bounded depth circuits; Lower bounds; Matrix products; Superconcentrators

Indexed keywords

BOOLEAN FUNCTIONS; DIGITAL ARITHMETIC; GATES (TRANSISTOR); GRAPH THEORY; MATRIX ALGEBRA;

BOUNDED DEPTH CIRCUITS; LOWER BOUNDS; MATRIX PRODUCTS;

BOUNDARY CONDITIONS;

EID: 0037609044     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970138462X     Document Type: Article

References (20)

1. 1-formulae on finite structures, Ann. Pure Appl. Logic, 24 (1983), pp. 1-48.
2. 2-lower bound for the rank of n × n-matrix multiplication over arbitrary fields, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 45-50.
3. N. H. Bshouty, A lower bound for matrix multiplication, SIAM J. Comput., 18 (1989), pp. 759-765.
4. W. Baur and V. Strassen, The complexity of partial derivatives, Theoret. Comput. Sci., 22 (1982), pp. 317-330.
5. D. Dolev, C. Dwork, N. J. Pippenger, and A. Wigderson, Superconcentrators, generalizer and generalized connectors, in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, ACM, New York, 1983, pp. 42-51.
6. M. L. Furst, J. B. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, in Proceedings of the 22nd Annual IEEE Synposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1981, pp. 260-270.
7. J. von zur Gathen, Algebraic complexity theory, in Annual Review of Computer Science, Vol. 3, Annual Reviews, Palo Alto, CA, 1988, pp. 317-347.
8. D. Grigoriev and M. Karpinski, An exponential lower bound for depth 3 arithmetic circuits, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 577-582.
9. D. Grigoriev and A. A. Razborov, Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1998, pp. 269-278.
10. J. Håstad, Almost optimal lower bounds for small depth circuits, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing, ACM, New York, 1986, pp. 6-20.
11. A. Hajnal, W. Maass, P. Pudlak, M. Szegedy, and G. Turan, Threshold circuits of bounded depth, in Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1987, pp. 99-110.
12. R. Impagliazzo, R. Paturi, and M. E. Saks, Size-depth tradeoffs for threshold circuits, SIAM J. Comput., 26 (1997), 693-707.
13. P. Pudlak, Communication in bounded depth circuits, Combinatorica, 14 (1994), pp. 203-216.
14. A. A. Razborov, Lower bounds for the size of circuits with bounded depth with basis {∧,⊕}, Math. Notes of the Academy of Science of the USSR, 41 (1987), pp. 333-338.
15. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 77-82.
16. V. Strassen, Gaussian elimination is not optimal, Numer. Math., 13 (1969), pp. 354-356.
17. V. Strassen, Die berechnungskomplexitat von elementarsymmetrischen funktionen und von interpolationskoefizienten, Numer. Math., 20 (1973), pp. 238-251.
18. A. Shpilka and A. Wigderson, Depth-3 arithmetic formulae over fields of characteristic zero, Electronic Colloquium on Computational Complexity, 6 (023), 1999.
19. L. G. Valiant, Graph-theoretic arguments in low-level complexity, in Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 53, Springer-Verlag, Berlin, 1977, pp. 162-176.
20. A. C. Yao, Separating the polynomial hierarchy by oracles, in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1985, pp. 1-10.