On the asymptotic complexity of rectangular matrix multiplication
From MaRDI portal
Publication:1173402
Cites work
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Approximate Solutions for the Bilinear Form Computational Problem
- Gaussian elimination is not optimal
- New combinations of methods for the acceleration of matrix multiplication
- New Fast Algorithms for Matrix Operations
- On the Number of Multiplications Required for Matrix Multiplication
- Partial and Total Matrix Multiplication
- Rapid Multiplication of Rectangular Matrices
- Relations between exact and approximate bilinear algorithms. Applications
- Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
Cited in
(15)- Parallel evaluation of the determinant and of the inverse of a matrix
- Efficient parallel linear programming
- Subquadratic-time algorithms for normal bases
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Improved distance sensitivity oracles with subcubic preprocessing time
- Fast and efficient linear programming and linear least-squares computations
- Subquadratic-time factoring of polynomials over finite fields
- Fast matrix multiplication and its algebraic neighbourhood
- Bounds and algorithms for graph trusses
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.
- Faster dynamic range mode
- Faster algorithms for Schatten-p low rank approximation
- Barriers for rectangular matrix multiplication
- Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
- A couple of simple algorithms for k-dispersion
This page was built for publication: On the asymptotic complexity of rectangular matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173402)
