Publisher
Springer Berlin Heidelberg
Reference23 articles.
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(n 2:7799) complexity for matrix multiplication. Inf. Proc. Letters, 8:234–235, 1979.
3. Markus Bläser. A 5/2n 2lower bound for the rank of nxnmatrix 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.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
2. Universal points in the asymptotic spectrum of tensors;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
3. On computational complexity of Clifford algebra;Journal of Mathematical Physics;2009-05
4. Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical;Automata, Languages and Programming;2001
5. Signature Schemes Based on 3rd Order Shift Registers;Information Security and Privacy;2001