On the asymptotic complexity of rectangular matrix multiplication (Q1173402): Difference between revisions

@@ Property / cites work @@
+\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
+Normal rank
@@ Property / cites work @@
+Relations between exact and approximate bilinear algorithms. Applications
+Normal rank
@@ Property / cites work @@
+Approximate Solutions for the Bilinear Form Computational Problem
+Normal rank
@@ Property / cites work @@
+On the Number of Multiplications Required for Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Rapid Multiplication of Rectangular Matrices
@@ Property / cites work: Rapid Multiplication of Rectangular Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+New Fast Algorithms for Matrix Operations
@@ Property / cites work: New Fast Algorithms for Matrix Operations / rank @@
+Normal rank
@@ Property / cites work @@
+New combinations of methods for the acceleration of matrix multiplication
+Normal rank
@@ Property / cites work @@
+Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Partial and Total Matrix Multiplication
@@ Property / cites work: Partial and Total Matrix Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank