Fetching the paper…
Reading the bibliography…
We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics.
F. L. Hitchcock, The expression of a tensor or a polyadic as a sum of products, Journal of Mathematics and Physics
1927
Earlier work this paper cites.
J. D. Carroll, J. Chang, Analysis of individual differences in multidimensional scaling via an n-way generalization of Eckart–Young decomposition, Psychometrika
1970
Earlier work this paper cites.
J. E. Hopcroft, L. R. Kerr, On minimizing the number of multiplications necessary for matrix multiplication, SIAM Journal on Applied Mathematics
1971
Earlier work this paper cites.
R. Karp, Reducibility Among Combinatorial Problems, Proceedings of the Symposium on the Complexity of Computer Computations (1972) 85–103
1972
Earlier work this paper cites.
Y. Matiyasevich, J. Robinson, Reduction of an arbitrary Diophantine equation to one in 13 13 unknowns, Acta Arithmetica
1975
Earlier work this paper cites.
T. Gonzalez, J. Ja’Ja’, On the complexity of computing bilinear forms with { 0 , 1 } \{0,1\} constants, Journal of Computer and System Sciences
1980
Earlier work this paper cites.
V. Strassen, The asymptotic spectrum of tensors, J. Reine Angew. Math
1988
Earlier work this paper cites.
K. H. Kim, F. W. Roush, Problems equivalent to rational Diophantine solvability, Journal of Algebra
1989
Earlier work this paper cites.
J. Håstad, Tensor rank is NP-complete, Journal of Algorithms 11 (1990) 644–654
1990
Earlier work this paper cites.
B. Mazur, Questions of decidability and undecidability in number theory, Journal of Symbolic Logic
1994
Earlier work this paper cites.
R. Peeters, Orthogonal representations over finite fields and the chromatic number of graphs, Combinatorica
1996
Earlier work this paper cites.
J. F. Buss, G. S. Frandsen, J. O. Shallit, The computational complexity of some problems of linear algebra, Journal of Computer and System Sciences
1999
Earlier work this paper cites.
N. D. Sidiropoulos, R. Bro, G. B. Giannakis, Parallel factor analysis in sensor array processing, IEEE Transactions on Signal Processing
2000
Earlier work this paper cites.
B. Poonen, Hilbert’s tenth problem and Mazur’s conjecture for large subrings of ℚ \mathbb{Q} , Journal of the American Mathematical Society
2003
Cited alongside, same era.
A. Shashua, T. Hazan, Non-negative tensor factorization with applications to statistics and computer vision. In Proceedings of the 22nd international conference on Machine learning
2005
Cited alongside, same era.
P. Smolensky, Harmony in linguistic cognition, Cognitive Science
2006
Cited alongside, same era.
P. Comon, G. Golub, L. H. Lim, B. Mourrain, Symmetric tensors and symmetric tensor rank, SIAM Journal on Matrix Analysis and Applications
2008
Cited alongside, same era.
V. de Silva, L. H. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM Journal on Matrix Analysis and Applications
2008
Cited alongside, same era.
A. Bernardi, A. Gimigliano, M. Ida, Computing symmetric rank for symmetric tensors, Journal of Symbolic Computation
2011
Later among the works it cites.
J. M. Landsberg. Tensors: geometry and applications
2012
Later among the works it cites.
C. J. Hillar, L. H. Lim, Most tensor problems are NP-hard, Journal of the ACM
2013
Later among the works it cites.
L. Oeding, G. Ottaviani, Eigenvectors of tensors and algorithms for Waring decomposition, Journal of Symbolic Computation
2013
Later among the works it cites.
Y. Shitov, On the coincidence of the factor and Gondran–Minoux rank functions of matrices over a semiring, Journal of Mathematical Sciences
2013
Later among the works it cites.
M. Bläser, Explicit tensors. In Perspectives in Computational Complexity, Progress in Computer Science and Applied Logic
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Brachat, P. Comon, B. Mourrain, E. Tsigaridas, Symmetric tensor decomposition. In 17th European Signal Processing Conference
2009
Cited alongside, same era.
E. J. Candes, B. Recht, Exact matrix completion via convex optimization, Foundations of Computational mathematics
2009
Cited alongside, same era.
P. Comon, X. Luciani, A. L. F. De Almeida, Tensor decompositions, alternating least squares and other tales, Journal of Chemometrics
2009
Cited alongside, same era.
R. H. Keshavan, S. Oh, A. Montanari, Matrix completion from a few entries, in Proceedings of the 2009 IEEE International Symposium on Information Theory
2009
Cited alongside, same era.
T. G. Kolda, B. W. Bader, Tensor decompositions and applications, SIAM Review
2009
Cited alongside, same era.
M. Laurent, Matrix Completion Problems, Encyclopedia of Optimization
2009
Cited alongside, same era.
E. J. Candes, Y. Plan, Matrix completion with noise, Proceedings of the IEEE
2010
Cited alongside, same era.
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Later among the works it cites.
H. Derksen, Matrix completion and tensor rank, Linear & Multilinear Algebra
2016
Closest in time.
2016
Closest in time.
J. Koenigsmann, Defining ℤ {\mathbb{Z}} in ℚ {\mathbb{Q}} , Annals of Mathematics
2016
Closest in time.
E. Robeva, Orthogonal decomposition of symmetric tensors, SIAM Journal on Matrix Analysis and Applications
2016
Closest in time.