Lower bounds for the bilinear complexity of associative algebras

Computational Complexity

Volumn 9, Issue 2, 2000, Pages 73-112

  Bläser, Markus ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

Associative algebras; Bilinear complexity; Lower bound; Matrix multiplication; Rank; Substitution method

Indexed keywords

EID: 0034557785     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001605     Document Type: Article

References (27)

1. A. ALDER & V. STRASSEN (1981). On the algorithmic complexity of associative algebras. Theoret. Comput. Sci. 15, 201-211.
2. M. BLÄSER (1998). Bivariate polynomial multiplication. In Proc. 39th Ann. IEEE Symp. on Found. Comput. Sci. (FOCS), 186-191.
3. 2-lower bound for the rank of n×n-matrix multiplication over arbitrary fields. In Proc. 40th Ann. IEEE Symp. on Found. Comput. Sci. (FOCS), 45-50.
4. M. BLÄSER (1999b). Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity 8, 203-226.
5. M. BLÄSER (1999c). Untere Schranken für den Rang assoziativer Algebren. Dissertation, Universität Bonn.
6. R. W. BROCKETT & D. DOBKIN (1978). On the optimal evaluation of a set of bilinear forms. Linear Algebra Appl. 19, 207-235.
7. N. H. BSHOUTY (1989). A lower bound for matrix multiplication. SIAM J. Comput. 18, 759-765.
8. W. BÜCHI & M. CLAUSEN (1985). On a class of primary algebras of minimal rank. Linear Algebra Appl. 69, 249-268.
9. P. BÜRGISSER, M. CLAUSEN & M. A. SHOKROLLAHI (1997). Algebraic Complexity Theory. Springer.
10. P. M. COHN (1991). Algebra, volume 3. Wiley.
11. YU. A. DROZD & V. V. KIRICHENKO (1994). Finite Dimensional Algebras. Springer.
12. H. F. DE GROOTE (1978). On the varieties of optimal algorithms for the computation of bilinear mappings: The isotropy group of a bilinear mapping. Theoret. Comput. Sci. 7, 1-24.
13. H. F. DE GROOTE (1983). Characterization of division algebras of minimal rank and the structure of their algorithm varieties. SIAM J. Comput. 12, 101-117.
14. H. F. DE GROOTE (1986). Lectures on the Complexity of Bilinear Problems. Lecture Notes in Comput. Sci. 245, Springer.
15. H. F. DE GROOTE & J. HEINTZ (1983). Commutative algebras of minimal rank. Linear Algebra Appl. 55, 37-68.
16. W. HARTMANN (1985). On the multiplicative complexity of modules over associative algebras. SIAM J. Comput. 14, 383-395.
17. J. HEINTZ & J. MORGENSTERN (1986). On associative algebras of minimal rank. In Proceedings of the AAECC 2, Lecture Notes in Comput. Sci. 228, Springer, 1-24.
18. N. JACOBSON (1966). Lie Algebras. Interscience Publishers, 3rd edition.
19. J. C. LAFON & S. WINOGRAD (1978). 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 Mathématique, Univ. Louis Pasteur, Strasbourg, France.
20. V. PAN (1966). Methods for computing values of polynomials. Russian Math. Surveys 21, 105-136.
21. R. S. PIERCE (1982). Associative Algebras. Springer.
22. V. STRASSEN (1969). Gaussian elimination is not optimal. Numer. Math. 13, 354-356.
23. V. STRASSEN (1983). Rank and optimal computation of generic tensors. Linear Algebra Appl. 52/53, 645-685.
24. V. STRASSEN (1990). Algebraic complexity theory. In Handbook of Theoretical Computer Science Vol. A, J. van Leeuven, ed., Elsevier, 634-672.
25. B. L. VAN DER WAERDEN (1967). Algebra II. Springer, 5th edition.
26. B. L. VAN DER WAERDEN (1971). Algebra I. Springer, 8th edition.
27. S. WINOGRAD (1979). On multiplication in algebraic extension fields. Theoret. Comput. Sci. 8, 359-377.