arXiv Open Access 2024

Fixed-parameter tractability of canonical polyadic decomposition over finite fields

Jason Yang

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC

Penulis (1)

Jason Yang

Format Sitasi

APA MLA BibTeX

Yang, J. (2024). Fixed-parameter tractability of canonical polyadic decomposition over finite fields. https://arxiv.org/abs/2405.11699

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2024
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓