On the complexity of the multiplication of matrices of small formats-Reference-Cited by-同舟云学术

On the complexity of the multiplication of matrices of small formats

Published:2003-02 Issue:1 Volume:19 Page:43-60
ISSN:0885-064X
Container-title:Journal of Complexity
language:en
Short-container-title:Journal of Complexity

Author:

Bläser Markus

Publisher

Elsevier BV

Subject

Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics

Reference20 articles.

1. On the algorithmic complexity of associative algebras;Alder;Theoret. Comput. Sci.,1981

2. O(n2.7799) complexity for matrix multiplication;Bini;Inform. Process. Lett.,1979

3. M. Bläser, A 52 n2-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 (FOCS), 1999, pp. 45–50.

4. Lower bounds for the multiplicative complexity of matrix multiplication;Bläser;Comput. Complexity,1999

5. Lower bounds for the bilinear complexity of associative algebras;Bläser;Comput. Complexity,2000

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stability improvements for fast matrix multiplication;Numerical Algorithms;2024-04-20

2. О билинейной сложности умножения $3\times 2$ матрицы на $2\times 3$ матрицу;Дискретная математика;2024

3. A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field;Moscow University Computational Mathematics and Cybernetics;2023-12

4. Flip Graphs for Matrix Multiplication;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

5. Fast commutative matrix algorithms;Journal of Symbolic Computation;2023-01