News for hackers. Stuff that matters.
Re:Dynamic Programming: Chain Matrix Multiplication by wging on Thursday January 31, 2013 @12:20PM (#5146019)
Nice, but I feel I should point out that there are faster ways to multiply matrices than the naive O(n^3). I think we're down to O(n^2.3something). http://en.wikipedia.org/wiki/Matrix_multiplication#Algorithm...
Re:Dynamic Programming: Chain Matrix Multiplication by HalcyonicStorm on Thursday January 31, 2013 @01:16PM (#5146357)
Agreed. I was talking about the naive method of multiplying matricies. I could make another huge blog post on matrix multiplication algorithms. I am a particular fan of solving Ax=B type problems...hmmm maybe that could be a future post.