Jason Yang

New results in canonical polyadic decomposition over finite fields

2025 · arXiv (Cornell University)

Canonical polyadic decomposition (CPD) is at the core of fast matrix multiplication, a computational problem with widespread implications across several seemingly unrelated problems in computer science. Much recent progress in this field has used randomized …