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 a 3-dimensional tensor over a finite field $\mathbb{F}$ is fixed-parameter tractable with respect to $R$ and $\mathbb{F}$. We also show a nontrivial upper bound on the time complexity of this problem.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2024
- DOI:
- 10.48550/arXiv.2405.11699
- arXiv:
- arXiv:2405.11699
- Bibcode:
- 2024arXiv240511699Y
- Keywords:
-
- Computer Science - Computational Complexity
- E-Print:
- 12 pages