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 $\text{F}$ is at most $k$ over the algebraic closure of $\text{F}$, where $k$ is a given positive integer. We estimate the arithmetic complexity of our algorithm.