Multiply two sparse matrices
Multiply two matrices that are mostly zeros. Skip the zero entries: store only the non-zero values of each matrix (by row or as lists of positions) and multiply only those pairs. Compare the cost with the plain triple loop.
No answer yet. Write the first one; the best answer gets endorsed.
