Showing cs.CCShow all
3 papers · 1 filter
cs.CC2025
New results in canonical polyadic decomposition over finite fields
Jason Yang
Canonical polyadic decomposition (CPD) is at the core of fast matrix multiplication, a computational problem with widespread implications across several seemingly unrelated problem…
cs.CC2024
Fixed-parameter tractability of canonical polyadic decomposition over finite fields
Jason Yang
We present a simple proof that finding a rank- canonical polyadic decomposition of a 3-dimensional tensor over a finite field is fixed-parameter tractable with resp…
cs.CC2024
Low-Rank Tensor Decomposition over Finite Fields
Jason Yang
We show that finding rank- decompositions of a 3D tensor, for , over a fixed finite field can be done in polynomial time. However, if some cells in the tensor are allowe…