1 votes 1 votes In Strassen's Matrix Multiplication, what is the number of additions and multiplications done to get a better complexity than the normal matrix multiplication? $7$ and $16$ $18$ and $7$ $10$ and $8$ $7$ and $7$ Algorithms tbb-algorithms-2 + – Bikram asked May 26, 2017 • edited Aug 20, 2019 by Counsellor Bikram 396 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Using Divide and Conquer normal matrix multiplication would take : T(n)= 8T(n/2) + 4(n/2)2 therefore time complexity will be O(n3) with Strassens algorithm time taken is T(n)= 7T(n/2) + 18(n/2)2 therefore time complexity will be O(n2.81) Priyanka17 answered Sep 18, 2018 • selected Aug 16, 2019 by Bikram Priyanka17 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes intituive from the stratssen's equation. Bikram answered May 26, 2017 Bikram comment Share Follow See 1 comment See all 1 1 comment reply Sumit Rana 1 commented Dec 26, 2017 reply Follow Share how sir? please explain 0 votes 0 votes Please log in or register to add a comment.