Depth-first search for tensor rank and border rank over finite fields

Jason Yang

We present an $O^{\ast }\left(|\mathbb{F}{|}^{(R-n_{\ast })\left({\sum }_d{n}_d\right)+n_{\ast }}\right)$-time algorithm for determining whether a tensor of shape $n_0\times \cdots \times n_{D-1}$ over a fin…