A 5/2n2-lower bound for the multiplicative complexity of n × n-matrix multiplication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 99-109

  Bläser, Markus ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIVISION ALGEBRAS; FINITE DIMENSIONAL; LOWER BOUNDS; MULTIPLICATIVE COMPLEXITY; N-MATRIX; NON-COMMUTATIVE;

MATRIX ALGEBRA;

EID: 15744389986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_9     Document Type: Conference Paper

References (23)

1. A. Alder and V. Strassen. On the algorithmic complexity of associative algebras. Theoret. Comput. Sci., 15:201-211, 1981.
2. Dario Bini, Milvio Capovani, Grazia Lotti, and Francesco Romani. O(n2:7799) complexity for matrix multiplication. Inf. Proc. Letters, 8:234-235, 1979.
3. Markus Bläser. A 5/2n2-lower bound for the rank of n×n-matrix multiplication over arbitrary fields. In Proc. 40th Ann. IEEE Symp. on Found. Comput. Sci. (FOCS), pages 45-50, 1999.
4. Markus Bläser. Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity, 8:203-226, 1999.
5. Markus Bläser. Untere Schranken für den Rang assoziativer Algebren. Dissertation, Universität Bonn, 1999.
6. Markus Bläser. Lower bounds for the bilinear complexity of associative algebras. Comput. Complexity, to appear.
7. Roger W. Brockett and David Dobkin. On the optimal evaluation of a set of bilinear forms. Lin. Alg. Appl., 19:207-235, 1978.
8. Nader H. Bshouty. A lower bound for matrix multiplication. SIAM J. Comput., 18:759-765, 1989.
9. Peter Bürgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic Complexity Theory. Springer, 1997.
10. Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progression. J. Symbolic Comput., 9:251-280, 1990.
11. Yurij A. Drozd and Vladimir V. Kirichenko. Finite Dimensional Algebras. Springer, 1994.
12. Hans F. de Groote. Characterization of division algebras of minimal rank and the structure of their algorithm varieties. SIAM J. Comput., 12:101-117, 1983.
13. Hans F. de Groote. Lectures on the Complexity of Bilinear Problems. LNCS 245. Springer, 1986.
14. Joseph Ja'Ja'. On the complexity of bilinear forms with commutativity. SIAM J. Comput., 9:717-738, 1980.
15. Jean-Claude Lafon and Shmuel Winograd. A lower bound for the multiplicative complexity of the product of two matrices. Technical report, Centre de Calcul de L'Esplanade, U.E.R. de Mathematique, Univ. Louis Pasteur, Strasbourg, France, 1978.
16. Victor Yu. Pan. Methods for computing values of polynomials. Russ. Math. Surv., 21:105-136, 1966.
17. Richard S. Pierce. Associative Algebras. Springer, 1982.
18. Arnold Schönhage. Partial and total matrix multiplication. SIAM J. Comput., 10:434-455, 1981.
19. Volker Strassen. Gaussian elimination is not optimal. Num. Math., 13:354-356, 1969.
20. Volker Strassen. Vermeidung von Divisionen. J. Reine Angew. Math., 264:184-202, 1973.
21. Volker Strassen. Rank and optimal computation of generic tensors. Lin. Alg. Appl., 52/53:645-685, 1983.
22. Volker Strassen. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math., 375/376:406-443, 1987.
23. Volker Strassen. Algebraic complexity theory. In J. van Leeuven, editor, Handbook of Theoretical Computer Science Vol. A, pages 634-672. Elsevier Science Publishers B.V., 1990.