Re: [algogeeks] Sparse Matrix multiplication

2011-01-27 Thread Rohit Saraf
http://www.eecs.harvard.edu/~ellard/Q-97/HTML/root/node20.html -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to

[algogeeks] Sparse Matrix multiplication

2011-01-26 Thread punnu
A nxn matrix is sparse if the number of non-zero entries in the matrix is much less than n^2. Multiply 2 nxn matrices containing L1, L2, non- zero entries is O(L1L2). -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send