On bilinear algorithms over fields of different characteristics

DOI10.3103/S0278641913040067zbMath1332.68299OpenAlexW2056284437MaRDI QIDQ264010

Vladimir Lysikov

Publication date: 5 April 2016

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641913040067

zbMATH Keywords

algebraic complexity theorybilinear algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Global properties of tensor rank
• Relative bilinear complexity and matrix multiplication.
• Partial and Total Matrix Multiplication

This page was built for publication: On bilinear algorithms over fields of different characteristics