Faster search for tensor decomposition over finite fields
Name
3747199.3747555.pdf
Size
578.91 KB
Format
Adobe PDF
Checksum (MD5)
7d64ece9d74f0b745c14552090364148
Author(s)
Yang, Jason
Date Issued
November 10, 2025
Publisher
ACM|International Symposium on Symbolic and Algebraic Computation
Citation
Jason Yang. 2025. Faster search for tensor decomposition over finite fields. In Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation (ISSAC '25). Association for Computing Machinery, New York, NY, USA, 132โ139.
Version
Final published version
Abstract
We present an ๐
โ
(|F|
min{๐
, ร
๐โฅ2 ๐๐ }+(๐
โ๐0 ) (ร
๐โ 0 ๐๐ )
)-time algorithm for determining whether the rank of a concise tensor ๐ โ
F
๐0รยทยทยทร๐๐ทโ1
is โค ๐
, assuming ๐0 โฅ ยท ยท ยท โฅ ๐๐ทโ1 and ๐
โฅ ๐0.
For 3-dimensional tensors, we have a second algorithm running
in ๐
โ
(|F|
๐0+๐2+(๐
โ๐0+1โ๐โ ) (๐1+๐2 )+๐
2
โ ) time, where ๐โ :=
j
๐
๐0
k
+ 1.
Both algorithms use polynomial space and improve on our previous
work, which achieved running time ๐
โ
(|F|
๐0+(๐
โ๐0 ) (ร
๐ ๐๐ )
).
Description
ISSAC โ25, Guanajuato, Mexico
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3747199.3747555
