Vincent Le Chevalier wrote:
> Actually the complexity class of the algorithm remains exactly as
> relevant because it just says how the computation time asymptotically
> evolves as the data gets bigger. The optimization described here do not
> change that I believe. Just the multiplicative constant in front, which
> in practice is of course important as well ;-)

I think that BLAS probably uses a slightly more asymptotically efficient 
multiplication algorithm for matrices this size, but it's interesting 
that at best it only accounts for a small fraction of the speedup.

Post a reply to this message