On the Complexity of Finding Tensor Ranks
Mohsen Aliabadi , Shmuel Friedland
Communications on Applied Mathematics and Computation ›› 2021, Vol. 3 ›› Issue (2) : 281 -289.
On the Complexity of Finding Tensor Ranks
The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $\mathbb {F}$ is at most k over the algebraic closure of $\mathbb {F}$, where k is a given positive integer. We estimate the arithmetic complexity of our algorithm.
/
| 〈 |
|
〉 |
PDF
