Papers › Faster search for tensor decomposition over finite fields
Faster search for tensor decomposition over finite fields
Jason Yang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present an O^*(|𝔽|^(minR, ∑_(d≥2) n_d + (R-n₀)(∑_(d0) n_d)))-time algorithm for determining whether the rank of a concise tensor T∈𝔽^(n₀×…×n_(D-1)) is ≤R, assuming n₀≥…≥n_(D-1) and R≥n₀. For 3-dimensional tensors, we have a second algorithm running in O^*(|𝔽|^(n₀+n₂ + (R-n₀+1-r_*)(n₁+n₂)+r_*²)) time, where r_*:=⌊R/n₀⌋+1. Both algorithms use polynomial space and improve on our previous work, which achieved running time O^*(|𝔽|^(n₀+(R-n₀)(∑_d n_d))).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections