Can someone tell me the Complexity of the Addition & Subtraction for the Divide & Conquer Matrix Multiplication algorithm?

Question

Can someone tell me the Complexity of the Addition & Subtraction for the Divide & Conquer Matrix Multiplication algorithm?

I know that the complexities of addition and subtraction operations of the Classic matrix multiplication are (n^3-n^2) while Strassen’s is 6n^2.81 – 6n^2... but I can't seem to find the Divide & Conquer anywhere. Just figure if anyone would know, you guys would. Thanks

Answer 1

This might help. See the introduction section before the Strassen's Method.