Strassen's algorithm is a divide and conquer algorithm for multiplying two square matrices of dimension n by n where n is a power of 2. The runtime is O(n^log_2(7)) which beats the naive O(n^3) ...
These algorithms are analyzed and compared based on their theoretical and practical performance, as part of a thesis on efficient polynomial operations.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results