The time complexity of fully sparse matrix multiplication

DOI10.1137/1.9781611977912.167MaRDI QIDQ6645537

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

Publication date: 28 November 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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)