That's OK Mr. Rakib! :) But, how can a computer make faster this computation using parallel programming ? Can one real programming language's rotine make use this aproach giving to a sub-rotines concurrents tasks ? We make a change this question: what the computer's architecture that's make a faster multiplying matrixes using a parallel programming ?
2010/12/12 Rakib Ansary Saikot <[email protected]>: > It is NOT possible to multiply two matrices in less than O(n^2) simply > because there are n^2 elements, and you got to "touch" all of them at > least once! > > Rakib -- ---------------------------------------- Luciano. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
