A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- 1 January 1976
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 82 (1), 126-128
- https://doi.org/10.1090/s0002-9904-1976-13988-2
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 8 references indexed in Scilit:
- On the Number of Multiplications Required for Matrix MultiplicationSIAM Journal on Computing, 1976
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- On multiplication of 2 × 2 matricesLinear Algebra and its Applications, 1971
- Sur le calcul des produits de matricesNumerische Mathematik, 1971
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- ALGORITHMS FOR MATRIX MULTIPLICATIONPublished by Defense Technical Information Center (DTIC) ,1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- A New Algorithm for Inner ProductIEEE Transactions on Computers, 1968