Two bilinear $(3\times3)$-matrix multiplication algorithms of complexity 25 (Q1789204): Difference between revisions

@@ Property / cites work @@
+All pairs shortest paths using bridging sets and rectangular matrix multiplication
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the multiplication of matrices of small formats
+Normal rank
@@ Property / cites work @@
+A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
+Normal rank
@@ Property / cites work @@
+Q3816908
@@ Property / cites work: Q3816908 / rank @@
+Normal rank
@@ Property / cites work @@
+On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+On the complexity of some algorithms of matrix multiplication
+Normal rank
@@ Property / cites work @@
+On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
+Normal rank
@@ Property / cites work @@
+Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
+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

Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 (Q1789204): Difference between revisions