Multiplying matrices takes $O(n^{3})$ time to execute but we know that there are several algorithms that improves $n^{3}$ such as Strassen's algorithm which is about $n^{2.87}$. My question is: in librarys as Numpy in python, which algorithm and what is its times running?
0 Answers
Related