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
(34)- Revisiting matrix squaring
- Fast rectangular matrix multiplication and applications
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- High-dimensional approximate \(r\)-nets
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- The shifted number system for fast linear algebra on integer matrices
- A note on the multiplication of sparse matrices
- BRNGLR: a cubic Tomita-style GLR parsing algorithm
- Open problems around exact algorithms
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- Nonuniform ACC circuit lower bounds
- A Path Cover Technique for LCAs in Dags
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
- Fast matrix multiplication and its algebraic neighbourhood
- Further limitations of the known approaches for matrix multiplication
- On the definition of matrix multiplication
- On minimum witnesses for Boolean matrix multiplication
- The Closest Pair Problem under the Hamming Metric
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- All-pairs bottleneck paths in vertex weighted graphs
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- Barriers for rectangular matrix multiplication
- Powers of low rank sparse matrices
- On the complexity of fixed parameter clique and dominating set
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- Faster combinatorial algorithms for determinant and Pfaffian
- Fast dynamic transitive closure with lookahead
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time
- Fast rectangular matrix multiplication and some applications
- Faster multi-witnesses for Boolean matrix multiplication
- A note on compressed sensing and the complexity of matrix multiplication
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)
