Fast Sparse Matrix Multiplication

Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m non-zero elements. We present a new algorithm that multiplies A and B using O(m0.7

• Type: Conference
• Year: 2004
• Where: ESA
• Authors: Raphael Yuster, Uri Zwick
• Keywords: ESA 2004, Non-zero Elements