Complexity measures for matrix multiplication algorithms (Q1152202): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
+Normal rank
@@ Property / cites work @@
+Approximate Solutions for the Bilinear Form Computational Problem
+Normal rank
@@ Property / cites work @@
+Relations between exact and approximate bilinear algorithms. Applications
+Normal rank
@@ Property / cites work @@
+Fast multiplication of large numbers
@@ Property / cites work: Fast multiplication of large numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02575864
+Normal rank
@@ Property / OpenAlex ID @@
+W1993258999
@@ Property / OpenAlex ID: W1993258999 / rank @@
+Normal rank