December 1990
·
26 Reads
·
593 Citations
Journal of Algorithms
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.
What is this page?
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
Publications (1)
Citations (1)
... Deviations from the true CP rank may increase fitting errors and cause factor degeneracy. However, the tensor CP rank is NP-hard to compute [13] and there is no finite algorithm for determining the rank of a tensor [12,15]. These observations naturally lead us to raise the following question: Can we establish a tensor CP decomposition model with CP rank estimation simultaneously? ...
- Citing Article
December 1990
Journal of Algorithms