On the implementation of Strassen's fast multiplication algorithm

DOI10.1007/BF00268135zbMath0312.68026MaRDI QIDQ1219685

Martin Roth, Jacques Cohen

Publication date: 1976

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (6)

FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES ⋮ On the arithmetic complexity of Strassen-like matrix multiplications ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ An efficient preprocessor for solving systems of linear equations ⋮ Dense polynomial multiplication with reduced array manipulation overhead ⋮ Pyramids: A data type for matrix representation in Pascal

Cites Work

• Gaussian elimination is not optimal
• Triangular Factorization and Inversion by Fast Matrix Multiplication
• Two languages for estimating program efficiency
• Unnamed Item
• Unnamed Item

This page was built for publication: On the implementation of Strassen's fast multiplication algorithm