A 5/2n/sup 2/-lower bound for the rank of n×n-matrix multiplication over arbitrary fields
Publisher
IEEE Comput. Soc
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Matrix Multiplication and Polynomial Identity Testing;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
2. A Lower Bound on Determinantal Complexity;computational complexity;2022-09-19
3. An Introduction to the Computational Complexity of Matrix Multiplication;Journal of the Operations Research Society of China;2019-12-05
4. Fast matrix multiplication and its algebraic neighbourhood;Sbornik: Mathematics;2017-11
5. Tensor Rank: Matching Polynomials and Schur Rings;Foundations of Computational Mathematics;2014-03-25