Fixed-parameter tractability of canonical polyadic decomposition over finite fields
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929387055611904 |
|---|---|
| author | Yang, Jason |
| author_facet | Yang, Jason |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_11699 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fixed-parameter tractability of canonical polyadic decomposition over finite fields Yang, Jason Computational Complexity 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. |
| title | Fixed-parameter tractability of canonical polyadic decomposition over finite fields |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2405.11699 |