wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

The time complexity recurrence for Strassen's Matrix multiplication is

A
T(n)=4T(n/2)+n2
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
T(n)=8T(n/2)+n2
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
T(n)=7T(n/2)+n
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
T(n)=7T(n/2)+n2
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Join BYJU'S Learning Program
CrossIcon