Fetching the paper…
Reading the bibliography…
The tensor rank of a tensor t is the smallest number r such that t can be decomposed as a sum of r simple tensors.
doi:10.1007/BF02165411
V. Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (4) (1969) 354–356 · 1969
Earlier work this paper cites.
doi:10.1016/0024-3795(71)90009-7
S. Winograd, On multiplication of 2 × \times 2 matrices, Linear Algebra Appl. 4 (4) (1971) 381–388 · 1971
Earlier work this paper cites.
doi:10.1137/0120004
J. E. Hopcroft, L. R. Kerr, On minimizing the number of multiplications necessary for matrix multiplication, SIAM J. Appl. Math. 20 (1971) 30–36 · 1971
Earlier work this paper cites.
doi:10.1007/3-540-08921-7_72
D. Y. Grigoriev, Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication, in: Mathematical foundations of computer science, 1978 (Proc. Seventh Sympos., Zakopane, 1978), Vol. 64 of Lecture Notes in Comput. Sci., Springer, Berlin-New York, 1978, pp. 250–256 · 1978
Earlier work this paper cites.
doi:10.1137/0208037
J. JáJá, Optimal evaluation of pairs of bilinear forms, SIAM J. Comput. 8 (3) (1979) 443–462 · 1979
Earlier work this paper cites.
doi:10.1137/0209053
D. Bini, G. Lotti, F. Romani, Approximate solutions for the bilinear form computational problem, SIAM J. Comput. 9 (4) (1980) 692–697 · 1980
Earlier work this paper cites.
doi:10.1007/BF02575865
D. Bini, Relations between exact and approximate bilinear algorithms. Applications, Calcolo 17 (1) (1980) 87–97 · 1980
Earlier work this paper cites.
doi:10.1137/0210032
A. Schönhage, Partial and total matrix multiplication, SIAM J. Comput. 10 (3) (1981) 434–455 · 1981
Earlier work this paper cites.
doi:10.1016/0024-3795(83)80041-X
V. Strassen, Rank and optimal computation of generic tensors, Linear Algebra Appl. 52/53 (1983) 645–685 · 1983
Earlier work this paper cites.
A. Alder, Grenzrang und grenzkomplexität aus algebraischer und topologischer sicht, Ph.D. thesis, Zürich University (1984)
1984
Earlier work this paper cites.
L. Teichert, Die Komplexität von Bilinearformpaaren über beliebigen Körpern., Mathematisch-Naturwissenschaftliche Fakultät der Technischen Universität Clausthal (1986)
1986
Earlier work this paper cites.
doi:10.1515/crll.1987.375-376.406
V. Strassen, Relative bilinear complexity and matrix multiplication, J. Reine Angew. Math. 375/376 (1987) 406–443 · 1987
Cited alongside, same era.
doi:10.1515/crll.1988.384.102
V. Strassen, The asymptotic spectrum of tensors, J. Reine Angew. Math. 384 (1988) 102–152 · 1988
Cited alongside, same era.
doi:10.1016/0304-3975(89)90141-2
T. Lehmkuhl, T. Lickteig, On the order of approximation in approximative triadic decompositions of tensors, Theoret. Comput. Sci. 66 (1) (1989) 1–14 · 1989
Cited alongside, same era.
doi:10.1515/crll.1991.413.127
V. Strassen, Degeneration and complexity of bilinear maps: some asymptotic spectra, J. Reine Angew. Math. 413 (1991) 127–180 · 1991
Cited alongside, same era.
doi:10.1007/978-3-662-03338-8
P. Bürgisser, M. Clausen, M. A. Shokrollahi, Algebraic complexity theory, Vol. 315 of Grundlehren Math. Wiss., Springer-Verlag, Berlin, 1997 · 1997
Cited alongside, same era.
F. R. Gantmacher, The theory of matrices. Vol. 2. Transl. from the Russian by K. A. Hirsch. Reprint of the 1959 translation., reprint of the 1959 translation Edition, Providence, RI: AMS Chelsea Publishing, 1998
doi:10.1126/science.1232957
M. Walter, B. Doran, D. Gross, M. Christandl, Entanglement polytopes: multiparticle entanglement from single-particle information, Science 340 (6137) (2013) 1205–1208 · 2013
Later among the works it cites.
doi:10.1134/S0081543813070079
V. B. Alekseev, A. V. Smirnov, On the exact and approximate bilinear complexities of multiplication of 4 × 2 4\times 2 and 2 × 2 2\times 2 matrices, Proc. Steklov Inst. Math. 282 (suppl. 1) (2013) S123–S139 · 2013
Later among the works it cites.
doi:10.1142/S0129055X14500044
A. Sawicki, M. Oszmaniec, M. Kuś, Convexity of momentum map, Morse index, and quantum entanglement, Rev. Math. Phys. 26 (3) (2014) 1450004, 39 · 2014
Later among the works it cites.
J. Draisma, Multilinear Algebra and Applications (lecture notes) (2015). URL https://mathsites.unibe.ch/jdraisma/publications/mlappl.pdf
2015
Later among the works it cites.
J. M. Landsberg, G. Ottaviani, New lower bounds for the border rank of matrix multiplication, Theory Comput. 11 (2015) 285–298 · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1998
Cited alongside, same era.
doi:10.1090/S0894-0347-05-00506-0
J. M. Landsberg, The border rank of the multiplication of 2 × 2 2\times 2 matrices is seven, J. Amer. Math. Soc. 19 (2) (2006) 447–459 · 2006
Cited alongside, same era.
doi:10.1137/06066518X
V. de Silva, L.-H. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM J. Matrix Anal. Appl. 30 (3) (2008) 1084–1127 · 2008
Cited alongside, same era.
doi:10.1103/PhysRevA.81.014301
N. Yu, E. Chitambar, C. Guo, R. Duan, Tensor rank of the tripartite state W tensor n n , Phys. Rev. A 81 (1) (2010) 014301 · 2010
Cited alongside, same era.
J. M. Landsberg, Tensors: geometry and applications, Vol. 128, American Mathematical Society Providence, RI, USA, 2012
2012
Cited alongside, same era.
doi:10.4086/toc.gs.2013.005
M. Bläser, Fast Matrix Multiplication, no. 5 in Graduate Surveys, Theory of Computing Library, 2013 · 2013
Cited alongside, same era.
R. Saptharishi, A survey of lower bounds in arithmetic circuit complexity 3.0.2, online survey, https://github.com/dasarpmar/lowerbounds-survey (2016)
2016
Later among the works it cites.
M. Christandl, P. Vrana, J. Zuiddam, Asymptotic tensor rank of graph tensors: beyond matrix multiplication (2016) · 2016
Later among the works it cites.
M. Bläser, M. Christandl, J. Zuiddam, The border support rank of two-by-two matrix multiplication is seven (2017) · 2017
Closest in time.
L. Chen, S. Friedland, The tensor rank of tensor product of two three-qubit W states is eight (2017) · 2017
Closest in time.
doi:10.1016/j.laa.2017.03.015
J. Zuiddam, A note on the gap between rank and border rank, Linear Algebra Appl. 525 (2017) 33–44 · 2017
Closest in time.
H. Buhrman, M. Christandl, J. Zuiddam, Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication, in: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017, pp. 24:1–24:18 · 2017
Closest in time.