Fixed-parameter tractability of canonical polyadic decomposition over finite fields

Abstract

We present a simple proof that finding a rank-$R$ canonical polyadic decomposition of 3-dimensional tensors over a finite field $\mathbb{F}$ is fixed-parameter tractable with respect to $R$ and $\mathbb{F}$. We also show some more concrete upper bounds on the time complexity of this problem.