Author:
Christandl Matthias,Zuiddam Jeroen
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference33 articles.
1. Andris Ambainis, Yuval Filmus & François Le Gall (2015). Fast matrix multiplication: limitations of the Coppersmith-Winograd method. In STOC’15—Proceedings of the 2015 ACM Symposium on Theory of Computing, 585–593. ACM, New York.
2. Bläser Markus (2003) On the complexity of the multiplication of matrices of small formats. J. Complexity 19(1):43–60
https://doi.org/10.1016/S0885-064X(02)00007-9
3. Harry Buhrman, Matthias Christandl & Jeroen Zuiddam (2017). Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 24:1–24:18. ISBN 978-3-95977-029-3. ISSN 1868-8969. URL
http://drops.dagstuhl.de/opus/volltexte/2017/8181
.
4. Peter Bürgisser, Michael Clausen & M. Amin Shokrollahi (1997). Algebraic complexity theory, volume 315 of Grundlehren Math. Wiss. Springer-Verlag, Berlin. ISBN 3-540-60582-7, xxiv+618 .URL
http://dx.doi.org/10.1007/978-3-662-03338-8
.
5. Peter Bürgisser & Christian Ikenmeyer (2011). Geometric complexity theory and tensor rank. In STOC’11—Proceedings of the 43rd ACM Symposium on Theory of Computing, 509–518. ACM, New York. URL
http://dx.doi.org/10.1145/1993636.1993704
.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献