Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann. The Time Complexity of Fully Sparse Matrix Multiplication. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 4670-4703, SIAM, 2024. [doi]
Abstract is missing.