Fixed-parameter tractability of canonical polyadic decomposition over finite fields
Abstract
We present a simple proof that finding a rank-R canonical polyadic decomposition of a 3-dimensional tensor over a finite field F is fixed-parameter tractable with respect to R and F. We also show a nontrivial upper bound on the time complexity of this problem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.