On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185): Difference between revisions

@@ Property / author @@
+Sumit K. Garg
@@ Property / author: Sumit K. Garg / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W30
@@ Property / Mathematics Subject Classification ID: 68W30 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6380775
@@ Property / zbMATH DE Number: 6380775 / rank @@
+Normal rank
@@ 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 @@
+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 @@
+\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
+Normal rank
@@ Property / cites work @@
+On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+On the complexity of some algorithms of matrix multiplication
+Normal rank
@@ Property / cites work @@
+On Winograd's Algorithm for Inner Products
@@ Property / cites work: On Winograd's Algorithm for Inner Products / rank @@
+Normal rank
@@ Property / cites work @@
+Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s0081543813070079
+Normal rank
@@ Property / OpenAlex ID @@
+W1964758312
@@ Property / OpenAlex ID: W1964758312 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:483185