Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
From MaRDI portal
Recommendations
- Powers of tensors and fast matrix multiplication
- Fast matrix multiplication: limitations of the Coppersmith-Winograd method (extended abstract)
- Multiplying matrices faster than coppersmith-winograd
- Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors
- Fast rectangular matrix multiplication and applications
Cited in
(61)- Subquadratic-time algorithms for normal bases
- Amortized multi-point evaluation of multivariate polynomials
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
- Computing Riemann-Roch spaces via Puiseux expansions
- Improved distance sensitivity oracles with subcubic preprocessing time
- Sparse equisigned PCA: algorithms and performance bounds in the noisy rank-1 setting
- Sparse matrix multiplication and triangle listing in the congested clique model
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- Improved bounds for rectangular monotone min-plus product and applications
- Fast matrix multiplication: limitations of the Coppersmith-Winograd method (extended abstract)
- Powers of tensors and fast matrix multiplication
- Graph expansion analysis for communication costs of fast rectangular matrix multiplication
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
- Hamming Distance Completeness
- Classical algorithms from quantum and Arthur-Merlin communication protocols
- Sparse matrix multiplication and triangle listing in the congested clique model
- Faster Algorithms for All Pairs Non-Decreasing Paths Problem
- Limits on the Universal method for matrix multiplication
- Bounds and algorithms for graph trusses
- scientific article; zbMATH DE number 7250154 (Why is no real title available?)
- Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.
- Intersection graphs of non-crossing paths
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
- A faster interior-point method for sum-of-squares optimization
- Testing indexability and computing Whittle and Gittins index in subcubic time
- Univariate polynomial factorization over finite fields with large extension degree
- High-order lifting for polynomial Sylvester matrices
- Finding small complete subgraphs efficiently
- An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
- Optimal eigenvalue approximation via sketching
- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- \((\min ,+)\) matrix and vector products for inputs decomposable into few monotone subsequences
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
- A refined laser method and faster matrix multiplication
- Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- Faster dynamic range mode
- Towards optimal set-disjointness and set-intersection data structures
- An algebraic formulation of Pauli flow, leading to faster flow-finding algorithms
- 3SUM in preprocessed universes: faster and simpler
- Randomised subspace system identification: complexities and error bounds
- Faster algorithms for Schatten-p low rank approximation
- Matrix multiplication verification using coding theory
- Unbalanced triangle detection and enumeration hardness for unions of conjunctive queries
- (, +) matrix and vector products for inputs decomposable into few monotone subsequences
- Barriers for rectangular matrix multiplication
- An improved algorithm for the k-Dyck edit distance problem
- Faster modular composition
- Enumeration algorithms for conjunctive queries with projection
- Current algorithms for detecting subgraphs of bounded treewidth are probably optimal
- Algorithms, reductions and equivalences for small weight variants of all-pairs shortest paths
- Approximation algorithms for min-distance problems in DAGs
- Faster monotone min-plus product, range mode, and single source replacement paths
- Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
- Removing the log factor from (,+)-products on bounded range integer matrices
- A couple of simple algorithms for k-dispersion
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
This page was built for publication: Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607951)
