Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. A. Alder and V. Strassen. On the algorithmic complexity of associative algebras. Theoret. Comput. Sci., 15:201–211, 1981.
2. Markus Bläser. Bivariate polynomial multiplication. In Proc. 39th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pages 186–191, 1998.
3. Markus Bläser. Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity, 8:203–226, 1999.
4. Markus Bläser. Untere Schranken für den Rang assoziativer Algebren. Dissertation, Universität Bonn, 1999.
5. Markus Bläser. Lower bounds for the bilinear complexity of associative algebras. Comput. Complexity, 9:73–112, 2000.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献