Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations
- 1 October 1978
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 166-176
- https://doi.org/10.1109/sfcs.1978.34
Abstract
A new technique of trilinear operations of aggregating, uniting and canceling is introduced and applied to constructing fast linear non-commutative algorithms for matrix multiplication. The result is an asymptotic improvement of Strassen's famous algorithms for matrix operations.Keywords
This publication has 16 references indexed in Scilit:
- Addition Requirements for Rational FunctionsSIAM Journal on Computing, 1977
- On the Number of Multiplications Required for Matrix MultiplicationSIAM Journal on Computing, 1976
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplicationsBulletin of the American Mathematical Society, 1976
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- On the optimal evaluation of a set of bilinear formsPublished by Association for Computing Machinery (ACM) ,1973
- On the additions necessary to compute certain functionsPublished by Association for Computing Machinery (ACM) ,1972
- On multiplication of 2 × 2 matricesLinear Algebra and its Applications, 1971
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- Fast matrix multiplicationPublished by Association for Computing Machinery (ACM) ,1971
- Some techniques for proving certain simple programs optimalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1969