Tensor rank is NP-complete
Part of the Lecture Notes in Computer Science book series (LNCS, volume 372)
We prove that computing the rank of a three-dimensional tensor over any finite field is NP-complete. Over the rational numbers the problem is NP-hard.
Key wordsNP-completeness tensor rank bilinear complexity multiplicative complexity
AMS classification68C25 68E99
Unable to display preview. Download preview PDF.
- [B]Bshouty N.H. “A Lower Bound for Matrix Multiplication”, Proceedings 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp 64–67.Google Scholar
- [C]Cook S.A. “On the Complexity of Theorem Proving Procedures”, Proceedings 3rd Annual ACM Symposium on the Theory of Computing, pp 151–159.Google Scholar
- [CW]Coppersmith D. and Winograd S., “Matrix Multiplication via Arithmetic Progressions”, Proceedings 19th Annual ACM Symposium on the Theory of Computing, pp 1–6.Google Scholar
- [GaJo]Garey M. R. and Johnson D.S., “Computers and Intractability”, W.H. Freeman and Company, 1979.Google Scholar
- [S1]Strassen V. “The asymptotic spectrum of tensors”, manuscript, 1986.Google Scholar
- [S2]Strassen V. “Rank and Optimal Computation of Generic Tensors”, Linear Algebra and its applications 52/53 (1983), pp 645–685.Google Scholar
© Springer-Verlag Berlin Heidelberg 1989