Rectangular matrix multiplication revisited
From MaRDI portal
Publication:1361875
DOI10.1006/JCOM.1997.0438zbMATH Open0872.68052OpenAlexW2089311600MaRDI QIDQ1361875FDOQ1361875
Authors: Don Coppersmith 
Publication date: 28 July 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1997.0438
Recommendations
- Fast rectangular matrix multiplication and some applications
- Fast rectangular matrix multiplication and applications
- scientific article; zbMATH DE number 3900946
- Area-period tradeoffs for multiplication of rectangular matrices
- Revisiting matrix squaring
- Matrix multiplication via arithmetic progressions
- On vector-Kronecker product multiplication with rectangular factors
- Fast rectangular matrix multiplication and QR decomposition
- scientific article; zbMATH DE number 1254016
- Reproducible and accurate matrix multiplication
Cites Work
Cited In (32)
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
- High-dimensional approximate \(r\)-nets
- Fast rectangular matrix multiplication and applications
- BRNGLR: a cubic Tomita-style GLR parsing algorithm
- Faster multi-witnesses for Boolean matrix multiplication
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- Open problems around exact algorithms
- Fast dynamic transitive closure with lookahead
- Fast matrix multiplication and its algebraic neighbourhood
- A note on compressed sensing and the complexity of matrix multiplication
- On the complexity of fixed parameter clique and dominating set
- Faster combinatorial algorithms for determinant and Pfaffian
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- Fast rectangular matrix multiplication and some applications
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- On the definition of matrix multiplication
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- The shifted number system for fast linear algebra on integer matrices
- Revisiting matrix squaring
- A fast output-sensitive algorithm for Boolean matrix multiplication
- A Path Cover Technique for LCAs in Dags
- All-pairs bottleneck paths in vertex weighted graphs
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time
- The Closest Pair Problem under the Hamming Metric
- Further Limitations of the Known Approaches for Matrix Multiplication
- Nonuniform ACC Circuit Lower Bounds
- On minimum witnesses for Boolean matrix multiplication
- A note on the multiplication of sparse matrices
This page was built for publication: Rectangular matrix multiplication revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361875)
