Tensor rank is NP-complete
- 1 January 1989
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 451-460
- https://doi.org/10.1007/bfb0035776
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A lower bound for matrix multiplicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,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