Extending the four Russians' bound to general matrix multiplication

DOI10.1016/S0020-0190(80)90080-0zbMath0446.68033MaRDI QIDQ1145999

Nicola Santoro

Publication date: 1980

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

zbMATH Keywords

analysis of algorithmsBoolean matrixmatrix multiplicationfour Russians' method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

The Mailman algorithm: a note on matrix-vector multiplication

Cites Work

• Gaussian elimination is not optimal
• On the Number of Multiplications Required for Matrix Multiplication
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending the four Russians' bound to general matrix multiplication