On bilinear algorithms over fields of different characteristics

DOI10.3103/S0278641913040067MaRDI QIDQ264010zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 858680 (Why is no real title available?)
• Global properties of tensor rank
• Partial and Total Matrix Multiplication
• Relative bilinear complexity and matrix multiplication.

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

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