Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations
@article{Pan1978StrassensAI, title={Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations}, author={V. Pan}, journal={19th Annual Symposium on Foundations of Computer Science (sfcs 1978)}, year={1978}, pages={166-176} }
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.
Topics from this paper
115 Citations
The Technique of Trilinear Aggregating and the Recent Progress in the Asymptotic Acceleration of Matrix Operations
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1984
- 5
Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplications
- Mathematics, Computer Science
- 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
- 1979
- 45
Multiplying matrices faster than coppersmith-winograd
- Mathematics, Computer Science
- STOC '12
- 2012
- 843
- PDF
References
SHOWING 1-10 OF 28 REFERENCES
Duality applied to the complexity of matrix multiplications and other bilinear forms
- Mathematics, Computer Science
- STOC '73
- 1973
- 41
- PDF
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- Mathematics, Computer Science
- SIAM J. Comput.
- 1973
- 81
- PDF
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Mathematics
- 1969
- 151
- PDF