Faster algorithms for rectangular matrix multiplication

DOI10.1109/FOCS.2012.80MaRDI QIDQ6988193zbMATH OpenFDO

Authors François Le Gall

Publication date 5 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2012.80

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(6)

• Faster dynamic range mode
• Towards optimal set-disjointness and set-intersection data structures
• It's hard to HAC average linkage!
• Fine-grained analysis and faster algorithms for iteratively solving linear systems
• Faster algorithms for Schatten-p low rank approximation
• Barriers for rectangular matrix multiplication

This page was built for publication: Faster algorithms for rectangular matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988193)