On the approximate bilinear complexity of matrix multiplication (Q891131): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+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 @@
+\(0(n^{2.7799})\) complexity for \(n\times n\) approximate 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 @@
+The bilinear complexity and practical algorithms for matrix multiplication
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:891131