Tensor rank is NP-complete
- 1 December 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (4), 644-654
- https://doi.org/10.1016/0196-6774(90)90014-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The asymptotic spectrum of tensors.Journal für die reine und angewandte Mathematik (Crelles Journal), 1988
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- Rank and optimal computation of generic tensorsLinear Algebra and its Applications, 1983
- On the algorithmic complexity of associative algebrasTheoretical Computer Science, 1981
- On the complexity of computing bilinear forms with {0, 1} constantsJournal of Computer and System Sciences, 1980
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971