Fixed-parameter tractability of canonical polyadic decomposition over finite fields
<|reference_start|>Fixed-parameter tractability of canonical polyadic decomposition over finite fields: 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.<|reference_end|>
@article{yang2024fixed-parameter,
    title={Fixed-parameter tractability of canonical polyadic decomposition over
  finite fields},
    author={Jason Yang},
    journal={arXiv preprint arXiv:2405.11699},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.11699},
    primaryClass={cs.CC}
}