A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications

DOI10.1016/0020-0190(86)90108-0zbMath0614.65037OpenAlexW2072603417WikidataQ114215571 ScholiaQ114215571MaRDI QIDQ1819890

O. M. Makarov

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90108-0

zbMATH Keywords

matrix multiplicationcomplexity of computationfast noncommutative algorithms

Mathematics Subject Classification ID

Cites Work

• A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications
• Gaussian elimination is not optimal
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications