Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
|Answer» A. true|
|Explanation: since the coppersmith- winograd algorithm multiplies the matrices in o(n2.37) time. the time complexity of recursive multiplication of two square matrices by strassen’s method is found to be o(n2.80). therefore, coppersmith-winograd|
Login to Continue
It will take less than 2 minutes