   matrix multiplication
  Hello,According to wikipedia, the fastest current algorithm for multiplying two square matrices is the Coppersmith–Winograd algorithm. However, I am having a hard time finding information on how to implement this, google being no help.Thanks for any help,exorcist_bob   
  If your information about "fastest current algorithm" is from the Wikipedia site, you should also be aware of the comment made later at that site:  "The Coppersmith–Winograd algorithm is frequently used as building block in other algorithms to prove theoretical time bounds, but it appears to be not particularly practical for implementations."As with all big-O notation for the asymptotic order of an algorithm, it is important _in practice_ to know how large the constant is in the analysis.  If the constant in the Coppersmith-Winograd is so large that you would benefit only from the algorithm when the matrix size n is larger than what any practical problem requires, there is no point in wasting time implementing that algorithm.;  Also from WikipediaQuote:The Coppersmith–Winograd algorithm is frequently used as building block in other algorithms to prove theoretical time bounds, but it appears to be not particularly practical for implementations.An O(n2.378) algorithm is only faster than an O(n3) algorithm as n approaches infinity (and thus there exists some value x such that the former is always faster if n>x); there is no guarantee that the former is faster for all values of n.EDIT:  Looks like someone beat me to it.   ;  Furthermore, if you're doing a graphical game the fastest implementation is to ask your graphics card to do it for you as that takes the work off the CPU.   