{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:22:49Z","timestamp":1772367769238,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T00:00:00Z","timestamp":1521676800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00037-018-0164-8","type":"journal-article","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T06:01:24Z","timestamp":1521698484000},"page":"27-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Tensor surgery and tensor rank"],"prefix":"10.1007","volume":"28","author":[{"given":"Matthias","family":"Christandl","sequence":"first","affiliation":[]},{"given":"Jeroen","family":"Zuiddam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,22]]},"reference":[{"key":"164_CR1","doi-asserted-by":"crossref","unstructured":"Andris Ambainis, Yuval Filmus & Fran\u00e7ois Le Gall (2015). Fast matrix multiplication: limitations of the Coppersmith-Winograd method. In STOC\u201915\u2014Proceedings of the 2015 ACM Symposium on Theory of Computing, 585\u2013593. ACM, New York.","DOI":"10.1145\/2746539.2746554"},{"issue":"1","key":"164_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0885-064X(02)00007-9","volume":"19","author":"Markus Bl\u00e4ser","year":"2003","unstructured":"Bl\u00e4ser Markus (2003) On the complexity of the multiplication of matrices of small formats. J. Complexity 19(1):43\u201360 \n                    https:\/\/doi.org\/10.1016\/S0885-064X(02)00007-9","journal-title":"J. Complexity"},{"key":"164_CR3","unstructured":"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\u201324:18. ISBN 978-3-95977-029-3. ISSN 1868-8969. URL \n                    http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/8181\n                    \n                  ."},{"key":"164_CR4","doi-asserted-by":"crossref","unstructured":"Peter B\u00fcrgisser, 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 \n                    http:\/\/dx.doi.org\/10.1007\/978-3-662-03338-8\n                    \n                  .","DOI":"10.1007\/978-3-662-03338-8"},{"key":"164_CR5","doi-asserted-by":"crossref","unstructured":"Peter B\u00fcrgisser & Christian Ikenmeyer (2011). Geometric complexity theory and tensor rank. In STOC\u201911\u2014Proceedings of the 43rd ACM Symposium on Theory of Computing, 509\u2013518. ACM, New York. URL \n                    http:\/\/dx.doi.org\/10.1145\/1993636.1993704\n                    \n                  .","DOI":"10.1145\/1993636.1993704"},{"issue":"20","key":"164_CR6","doi-asserted-by":"publisher","first-page":"200501","DOI":"10.1103\/PhysRevLett.105.200501","volume":"105","author":"Lin Chen","year":"2010","unstructured":"Chen Lin, Chitambar Eric, Duan Runyao, Ji Zhengfeng, Winter Andreas (2010) Tensor rank and stochastic entanglement catalysis for multipartite pure states. Phys. Rev. Lett. 105(20): 200501 \n                    https:\/\/doi.org\/10.1103\/PhysRevLett.105.200501","journal-title":"Phys. Rev. Lett."},{"key":"164_CR7","unstructured":"Matthias Christandl, P\u00e9ter Vrana & Jeroen Zuiddam (2016). Asymptotic tensor rank of graph tensors: beyond matrix multiplication. arXiv URL \n                    https:\/\/arxiv.org\/abs\/1609.07476\n                    \n                  ."},{"key":"164_CR8","unstructured":"Henry Cohn & Christopher Umans (2012). Fast matrix multiplication using coherent configurations. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1074\u20131087. SIAM, Philadelphia, PA."},{"issue":"2","key":"164_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0165-1684(96)00079-5","volume":"53","author":"Pierre Comon","year":"1996","unstructured":"Comon Pierre, Mourrain Bernard (1996) Decomposition of quantics in sums of powers of linear forms. Signal Processing 53(2): 93\u2013107 \n                    http:\/\/dx.doi.org\/10.1016\/0165-1684(96)00079-5","journal-title":"Signal Processing"},{"key":"164_CR10","doi-asserted-by":"crossref","unstructured":"Don Coppersmith & Shmuel Winograd (1990). Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9(3), 251\u2013280. ISSN 0747-7171. URL \n                    http:\/\/dx.doi.org\/10.1016\/S0747-7171(08)80013-2\n                    \n                  .","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"#cr-split#-164_CR11.2","doi-asserted-by":"crossref","unstructured":"(24), 2611-2622. ISSN 0304-3975. URL   http:\/\/dx.doi.org\/10.1016\/j.tcs.2010.01.018    .","DOI":"10.1016\/j.tcs.2010.01.018"},{"key":"164_CR12","doi-asserted-by":"crossref","unstructured":"Hans F. de Groote (1978). On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping. Theoret. Comput. Sci. 7(1), 1\u201324. ISSN 0304-3975. URL \n                    http:\/\/dx.doi.org\/10.1016\/0304-3975(78)90038-5\n                    \n                  .","DOI":"10.1016\/0304-3975(78)90038-5"},{"key":"164_CR13","unstructured":"Johan H\u00e5stad (1990). Tensor rank is NP-complete. J. Algorithms\n                           11(4), 644\u2013654. ISSN 0196-6774. URL \n                    http:\/\/dx.doi.org\/10.1016\/0196-6774(90\n                    \n                  ."},{"key":"164_CR14","doi-asserted-by":"crossref","unstructured":"John E. Hopcroft & Leslie R. Kerr (1971). On minimizing the number of multiplications necessary for matrix multiplication. SIAM J. Appl. Math. 20, 30\u201336. ISSN 0036-1399. URL \n                    http:\/\/dx.doi.org\/10.1137\/0120004\n                    \n                  .","DOI":"10.1137\/0120004"},{"key":"164_CR15","doi-asserted-by":"crossref","unstructured":"Joseph M. Landsberg (2006). The border rank of the multiplication of 2 \u00d7\u00a0 2 matrices is seven. J. Amer. Math. Soc.\n                            19(2), 447\u2013459. ISSN 0894-0347. URL \n                    http:\/\/dx.doi.org\/10.1090\/S0894-0347-05-00506-0\n                    \n                  .","DOI":"10.1090\/S0894-0347-05-00506-0"},{"key":"164_CR16","unstructured":"Joseph M. Landsberg (2012). Tensors: geometry and applications, volume 128 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI. ISBN 978-0-8218-6907-9, xx+439 ."},{"key":"164_CR17","doi-asserted-by":"crossref","unstructured":"Joseph M. Landsberg & Giorgio Ottaviani (2013). Equations for secant varieties of Veronese and other varieties. Ann. Mat. Pura Appl. (4)\n                           192(4), 569\u2013606. ISSN 0373-3114. URL \n                    http:\/\/dx.doi.org\/10.1007\/s10231-011-0238-6\n                    \n                  .","DOI":"10.1007\/s10231-011-0238-6"},{"key":"164_CR18","doi-asserted-by":"crossref","unstructured":"Joseph M. Landsberg & Giorgio Ottaviani (2015). New lower bounds for the border rank of matrix multiplication. Theory Comput. 11, 285\u2013298. ISSN 1557-2862. URL \n                    http:\/\/dx.doi.org\/10.4086\/toc.2015.v011a011\n                    \n                  .","DOI":"10.4086\/toc.2015.v011a011"},{"key":"164_CR19","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Le Gall (2012). Faster algorithms for rectangular matrix multiplication. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science\u2014FOCS 2012, 514\u2013523. IEEE Computer Soc., Los Alamitos, CA.","DOI":"10.1109\/FOCS.2012.80"},{"key":"164_CR20","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Le Gall (2014). Powers of tensors and fast matrix multiplication. In ISSAC 2014\u2014Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, 296\u2013303. ACM, New York. URL \n                    http:\/\/dx.doi.org\/10.1145\/2608628.2608664\n                    \n                  .","DOI":"10.1145\/2608628.2608664"},{"key":"164_CR21","unstructured":"Lior Pachter & Bernd Sturmfels (editors) (2005). Algebraic Statistics for Computational Biology. Cambridge University Press. ISBN 9780511610684. URL \n                    https:\/\/www.cambridge.org\/core\/books\/algebraic-statistics-for-computational-biology\/2E5CCE6BB6751EB7423EE3D2BF40EBFF\n                    \n                  ."},{"key":"164_CR22","unstructured":"Marcus Schaefer & Daniel Stefankovic (2016). The Complexity of Tensor Rank. preprint. arXiv URL \n                    https:\/\/arxiv.org\/abs\/1612.04338\n                    \n                  ."},{"key":"164_CR23","unstructured":"Yaroslav Shitov (2016). How hard is the tensor rank? preprint. arXiv URL \n                           \n                    https:\/\/arxiv.org\/abs\/1611.01559\n                    \n                  ."},{"key":"164_CR24","doi-asserted-by":"crossref","unstructured":"A. V. Smirnov (2013). The bilinear complexity and practical algorithms for matrix multiplication. Zh. Vychisl. Mat. Mat. Fiz. 53(12), 1970\u20131984. ISSN 0044-4669. URL \n                    http:\/\/dx.doi.org\/10.1134\/S0965542513120129\n                    \n                  .","DOI":"10.1134\/S0965542513120129"},{"issue":"4","key":"164_CR25","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"Volker Strassen","year":"1969","unstructured":"Strassen Volker (1969) Gaussian elimination is not optimal. Numer. Math. 13(4): 354\u2013356","journal-title":"Numer. Math."},{"key":"164_CR26","doi-asserted-by":"crossref","unstructured":"Volker Strassen (1983). Rank and optimal computation of generic tensors. Linear Algebra Appl. 52\/53, 645\u2013685. ISSN 0024-3795. URL \n                    http:\/\/dx.doi.org\/10.1016\/0024-3795(83)80041-X\n                    \n                  .","DOI":"10.1016\/0024-3795(83)80041-X"},{"key":"164_CR27","doi-asserted-by":"crossref","unstructured":"Volker Strassen (1987). Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math. 375\/376, 406\u2013443. ISSN 0075-4102. URL \n                    http:\/\/dx.doi.org\/10.1515\/crll.1987.375-376.406\n                    \n                  .","DOI":"10.1515\/crll.1987.375-376.406"},{"key":"164_CR28","doi-asserted-by":"crossref","unstructured":"Volker Strassen (1988). The asymptotic spectrum of tensors. J. Reine Angew. Math. 384, 102\u2013152. ISSN 0075-4102. URL \n                    http:\/\/dx.doi.org\/10.1515\/crll.1988.384.102\n                    \n                  .","DOI":"10.1515\/crll.1988.384.102"},{"key":"164_CR29","doi-asserted-by":"crossref","unstructured":"Volker Strassen (1991). Degeneration and complexity of bilinear maps: some asymptotic spectra. J. Reine Angew. Math. 413, 127\u2013180. ISSN 0075-4102. URL \n                    http:\/\/dx.doi.org\/10.1515\/crll.1991.413.127\n                    \n                  .","DOI":"10.1515\/crll.1991.413.127"},{"key":"164_CR30","unstructured":"Volker Strassen (2005). Komplexit\u00e4t und Geometrie bilinearer Abbildungen. Jahresber. Deutsch. Math.-Verein. 107(1), 3\u201331. ISSN 0012-0456."},{"key":"164_CR31","doi-asserted-by":"crossref","unstructured":"P\u00e9ter Vrana & Matthias Christandl (2015). Asymptotic entanglement transformation between W and GHZ states. J. Math. Phys. 56(2), 022 204, 12. ISSN 0022-2488. URL \n                    http:\/\/dx.doi.org\/10.1063\/1.4908106\n                    \n                  .","DOI":"10.1063\/1.4908106"},{"key":"164_CR32","doi-asserted-by":"crossref","unstructured":"P\u00e9ter Vrana & Matthias Christandl (2017). Entanglement Distillation from Greenberger\u2013Horne\u2013Zeilinger Shares. Commun. Math. Phys. 352(2), 621\u2013627. ISSN 1432-0916. URL \n                    http:\/\/dx.doi.org\/10.1007\/s00220-017-2861-6\n                    \n                  .","DOI":"10.1007\/s00220-017-2861-6"},{"issue":"4","key":"164_CR33","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0024-3795(71)90009-7","volume":"4","author":"Shmuel Winograd","year":"1971","unstructured":"Winograd Shmuel(1971). On multiplication of 2\u00a0\u00d7\u00a02 matrices. Linear Algebra Appl. 4(4), 381\u2013388.","journal-title":"Linear Algebra Appl."}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-018-0164-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-018-0164-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-018-0164-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T11:29:22Z","timestamp":1556191762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-018-0164-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,22]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["164"],"URL":"https:\/\/doi.org\/10.1007\/s00037-018-0164-8","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,22]]},"assertion":[{"value":"27 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}