Faster search for tensor decomposition over finite fields

Jason Yang

We present an $O^{\ast }(|\mathbb{F}{|}^{\min \left\{R,{\sum }_{d\ge 2}{n}_d\right\}+(R-n_0)({\sum }_{d\ne 0}{n}_d)})$-time algorithm for determining whether the rank of a concise tensor $T\in\…