The time complexity of fully sparse matrix multiplication

DOI10.1137/1.9781611977912.167MaRDI QIDQ6645537zbMATH OpenFDO

Authors Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.167

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Matrix multiplication verification using coding theory
• Longest common extensions with wildcards: trade-off and applications

This page was built for publication: The time complexity of fully sparse matrix multiplication

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