Sciweavers

Share
ESA
2004
Springer

Fast Sparse Matrix Multiplication

10 years 8 months ago
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
Raphael Yuster, Uri Zwick
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where ESA
Authors Raphael Yuster, Uri Zwick
Comments (0)
books