On the complexity of matrix product

SIAM Journal on Computing

Volumn 32, Issue 5, 2003, Pages 1356-1369

  Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Algebraic complexity; Arithmetic circuits; Bounded coefficients model; Circuit complexity; Lower bounds; Singular values

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; LOGIC CIRCUITS; LOGIC GATES; MATHEMATICAL MODELS; NORMAL DISTRIBUTION; POLYNOMIALS; THEOREM PROVING; VECTORS;

ALGEBRAIC COMPLEXITY; ARITHMETIC CIRCUIT; BOUNDED COEFFICIENTS MODEL; CIRCUIT COMPLEXITY; LOWER BOUNDS; MATRIX PRODUCT; SINGULAR VALUES;

MATRIX ALGEBRA;

EID: 0344153336     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702402147     Document Type: Article

References (18)

1. N. Alon, J. H. Spencer, and P. Erdös, The Probabilistic Method, John Wiley and Sons, New York, 1992.
2. M. Bläser, A 2.5n lower bound for the rank of n × n matrix multiplication over arbitrary fields, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, New York, NY, 1999, pp. 45-50.
3. N. H. Bshouty, A lower bound for matrix multiplication, SIAM J. Comput., 18 (1989), pp. 759-765.
4. P. Burgisser and M. Lotz, Lower bounds on the bounded coefficient complexity of bilinear maps, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, Vancouver, BC, Canada, 2002.
5. B. Chazelle, A spectral approach to lower bounds with applications to geometric searching, SIAM J. Comput., 27 (1998), pp. 545-556.
6. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
7. J. V. Z. Gathen, Algebraic complexity theory, Ann. Rev. Comput. Sci., 3 (1988), pp. 317-347.
8. S. Geman, A limit theorem for the norm of random matrices, Ann. Probab., 8 (1980), pp. 252-261.
9. G. H. Golub and C. F. Van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1983.
10. A. J. Hoffman and H. W. Wielandt, The variation of the spectrum of normal matrices, Duke Math. J., 20 (1953), pp. 37-39.
11. S. V. Lokam, Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity, in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 6-15.
12. J. Morgenstern, Note on a lower bound of the linear complexity of the fast fourier transform, J. Assoc. Comput. Mach., 20 (1973), pp. 305-306.
13. N. Nissan and A. Wigderson, On the complexity of bilinear forms, in Proceedings of the 27th ACM Symposium on Theory of Computing, Las Vegas, NV, 1995, pp. 723-732.
14. P. Pudlak, A Note on Using the Determinant for Proving Lower Bounds on the Size of Linear Circuits, Electronic Colloquium on Computational Complexity (ECCC), Report 42, 1998.
15. R. Raz and A. Shpilka, Lower bounds for matrix product, in bounded depth circuits with arbitrary gates, in Proceedings of the 33rd ACM Symposium on Theory of Computing, Crete, Greece, 2001, pp. 409-418.
16. A. Shpilka, Lower bounds for matrix product, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, 2001.
17. J. W. Silverstein, The smallest eigenvalue of a large dimensional Wishart matrix, Ann. Probab., 13 (1985), pp. 1364-1368.
18. V. Strassen, Gaussian elimination is not optimal, Numer. Math., 13 (1969), pp. 354-356.