New combinations of methods for the acceleration of matrix multiplication (Q1154805): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(81)90009-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2160563446
@@ Property / OpenAlex ID: W2160563446 / 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 @@
+\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
+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 @@
+Partial and Total Matrix Multiplication
@@ Property / cites work: Partial and Total Matrix Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4190138
@@ Property / cites work: Q4190138 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4401564
@@ Property / cites work: Q4401564 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebras Having Linear Multiplicative Complexities
+Normal rank
@@ Property / cites work @@
+Q5676984
@@ Property / cites work: Q5676984 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Continued Fractions
+Normal rank
@@ Property / cites work @@
+On the number of multiplications necessary to compute certain functions
+Normal rank
@@ Property / cites work @@
+Q4047029
@@ Property / cites work: Q4047029 / rank @@
+Normal rank
@@ Property / cites work @@
+On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
+Normal rank
@@ Property / cites work @@
+Q5581154
@@ Property / cites work: Q5581154 / rank @@
+Normal rank