A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472): 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 @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3816908
@@ Property / cites work: Q3816908 / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between exact and approximate bilinear algorithms. Applications
+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 @@
+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 @@
+Partial and Total Matrix Multiplication
@@ Property / cites work: Partial and Total Matrix Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+The bilinear complexity and practical algorithms for matrix multiplication
+Normal rank
@@ Property / cites work @@
+\(0(n^{2.7799})\) complexity for \(n\times n\) approximate 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 @@
+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 @@
+On the approximate bilinear complexity of matrix multiplication
+Normal rank