1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
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…
Ruling Out Low-rank Matrix Multiplication Tensor Decompositions with Symmetries via SAT
Jason Yang
We analyze rank decompositions of the matrix multiplication tensor over . We restrict our attention to decompositions of rank , as only…
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…