A

Admin • 833K Points
Coach

Q. Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

Explanation by: Admin

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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.