On varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mapping
- 31 December 1978
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 7 (1) , 1-24
- https://doi.org/10.1016/0304-3975(78)90038-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the complexity of quaternion multiplicationInformation Processing Letters, 1975
- 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
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- Transformations on tensor spacesPacific Journal of Mathematics, 1967
- Semi-automorphisms of ringsDuke Mathematical Journal, 1947
- On Semi-Automorphisms of Division AlgebrasAnnals of Mathematics, 1947