Tensor rank is NP-complete
Author:
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 451-460
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
- A lower bound for matrix multiplication1988
- Matrix multiplication via arithmetic progressions1987
- 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 procedures1971