On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping

From MaRDI portal
Revision as of 03:58, 6 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1131837

DOI10.1016/0304-3975(78)90038-5zbMath0418.68036OpenAlexW2031905258MaRDI QIDQ1131837

Hans F. de Groote

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90038-5




Related Items (21)

Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u/<Q(u)^{\ell}>\), \(\ell >1\)] ⋮ Commutative algebras of minimal rankOn varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplicationSome fast algorithms multiplying a matrix by its adjointOn the complexity of the multiplication of matrices of small formatsDimension of tensor network varietiesTensor surgery and tensor rankOn varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of \(xy\) and \(yx\) where \(x,y\in M_2(K)\)Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplicationOn the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplicationClassification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u/\langle{} u^ n \rangle\)] ⋮ Towards a geometric approach to Strassen's asymptotic rank conjectureNew ways to multiply \(3 \times 3\)-matricesThe geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matricesOn the additive complexity of 2 \(\times 2\) matrix multiplicationFundamental invariants of orbit closuresTwo bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 MatricesOn symmetries of tensor decompositions for the commutator of \(2 \times 2\) matricesEquivalent polyadic decompositions of matrix multiplication tensorsRank and optimal computation of generic tensors




Cites Work




This page was built for publication: On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping