2 ms·
> matrix multiplication, which is O((n^2)log(n)) Isn't the fastest theoretical algorithm something like O(n^2.37) ?
by petters 2y ago
> matrix multiplication, which is O((n^2)log(n))
Isn't the fastest theoretical algorithm something like O(n^2.37) ?
- jey 2y agoYes, but it's impractical unless you have galactic-scale matrices to multiply (at least).