The Time Complexity of Fully Sparse Matrix Multiplication

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

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

Journal title: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024

Journal publisher: SIAM

Published year: 2024

Published pages: 4670-4703

DOI identifier: 10.1137/1.9781611977912.167

ISBN: 978-1-61197-791-2