Improvements of the Alder-Strassen bound: Algebras with nonzero radical

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

Volumn 2076 LNCS, Issue , 2001, Pages 79-91

  Bläser, Markus ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

ALDER-STRASSEN BOUND; FINITE DIMENSIONAL; K-ALGEBRAS; LOWER BOUND TECHNIQUES; LOWER BOUNDS; MULTIPLICATIVE COMPLEXITY; UPPER TRIANGULAR MATRICES;

ALGEBRA;

EID: 23044527978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_7     Document Type: Conference Paper

References (16)

1. A. Alder and V. Strassen. On the algorithmic complexity of associative algebras. Theoret. Comput. Sci. , 15:201-211, 1981.
2. Markus Bl̈aser. Bivariate polynomial multiplication. In Proc. 39th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pages 186-191, 1998.
3. Markus Bl̈aser. Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity, 8:203-226, 1999.
4. Markus Bl̈aser. Untere Schranken f̈ur den Rang assoziativer Algebren. Dissertation, Universiẗat Bonn, 1999.
5. Markus Bl̈aser. Lower bounds for the bilinear complexity of associative algebras. Comput. Complexity, 9:73-112, 2000.
6. Markus Bl̈aser. A 52n2-lower bound for the multiplicative complexity of n×n-matrix multiplication. In Proc. 18th Int. GI-MIMD Symp. on Theoret. Aspects of Comput. Sci. (STACS), Lecture Notes in Comput. Sci. 2010, pages 99-110, 2001.
7. Werner Büchi. Uber eine Klasse von Algebren minimalen Rangs. Dissertation, Universiẗat Zürich, 1984.
8. Peter Bürgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic Complexity Theory. Springer, 1997.
9. Yurij A. Drozd and Vladimir V. Kirichenko. Finite Dimensional Algebras. Springer, 1994.
10. Hans F. de Groote. Lectures on the Complexity of Bilinear Problems. Lecture Notes in Comput. Science 245. Springer, 1986.
11. Joos Heintz and Jacques Morgenstern. On associative algebras of minimal rank. In Proc. 2nd Applied Algebra and Error Correcting Codes Conf. (AAECC), Lecture Notes in Comput. Sci. 228, pages 1-24. Springer, 1986.
12. Joseph Ja'Ja'. On the complexity of bilinear forms with commutativity. SIAM J. Comput. , 9:717-738, 1980.
13. Victor Ya. Pan. Methods for computing values of polynomials. Russ. Math. Surv. , 21:105-136, 1966.
14. Richard S. Pierce. Associative Algebras. Springer, 1982.
15. Volker Strassen. Vermeidung von Divisionen. J. Reine Angew. Math. , 264:184-202, 1973.
16. 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.