A normal form for matrix multiplication schemes (Q6108729): Difference between revisions

@@ Property / cites work @@
+Equivalent polyadic decompositions of matrix multiplication tensors
+Normal rank
@@ Property / cites work @@
+On the complexity of the multiplication of matrices of small formats
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+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 @@
+New ways to multiply \(3 \times 3\)-matrices
@@ Property / cites work: New ways to multiply \(3 \times 3\)-matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Noncommutative Bilinear Algorithms for $3 \times 3$ 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 inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
+Normal rank
@@ Property / cites work @@
+Fast commutative matrix algorithms
@@ Property / cites work: Fast commutative matrix algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The bilinear complexity and practical algorithms for matrix multiplication
+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 multiplication of 2 \(\times\) 2 matrices
@@ Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank @@
+Normal rank