Faster search for tensor decomposition over finite fields

DOI10.1145/3747199.3747555MaRDI QIDQ7288977zbMATH OpenFDO

Authors Jason Yang

Publication date 1 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3747199.3747555

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• Adaptive flip graph algorithm for matrix multiplication
• Discovering faster matrix multiplication algorithms with reinforcement learning
• Flip Graphs for Matrix Multiplication
• Gaussian elimination is not optimal
• Generalizations of matrix multiplication can solve the light bulb problem
• Improving the leading constant of matrix multiplication
• Local search for fast matrix multiplication
• More asymmetry yields faster matrix multiplication
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• On the complexity of some algorithms of matrix multiplication
• On the complexity of the multiplication of matrices of small formats
• Some new non-commutative matrix multiplication algorithms of size (n, m, 6)
• Tensor rank is NP-complete
• Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication

This page was built for publication: Faster search for tensor decomposition over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288977)