Abstract
Доказано, что над любым коммутативным кольцом билинейная сложность операции умножения $3\times 2$ матрицы на $2\times3$ матрицу равна $15$. Иными словами, известная схема Хопкрофта - Керра для умножения таких матриц является оптимальной, при любой области скаляров.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
