A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications (Q4085178): Difference between revisions

@@ Property / Wikidata QID @@
+Q114094111
@@ Property / Wikidata QID: Q114094111 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
+Normal rank
@@ Property / cites work @@
+On the Number of Multiplications Required for Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
+Normal rank
@@ Property / cites work @@
+On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Inner Product
@@ Property / cites work: A New Algorithm for Inner Product / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:4085178