On the inequivalence of bilinear algorithms for $3\times 3$ matrix multiplication (Q2444860): Difference between revisions

@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+On multiplication of 2 \(\times\) 2 matrices
@@ Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some algorithms of matrix multiplication
+Normal rank
@@ Property / cites work @@
+On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+On the Number of Multiplications Required for Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
+Normal rank
@@ Property / cites work @@
+On the complexity of the multiplication of matrices of small formats
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / cites work @@
+On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
+Normal rank
@@ Property / cites work @@
+On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
+Normal rank
@@ Property / cites work @@
+Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
+Normal rank

On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication (Q2444860): Difference between revisions

Latest revision as of 15:15, 7 July 2024

Statements

Sitelinks

Mathematics(1 entry)