CLRS Divide-and-Conquer Strassens's algorithm

Question

Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can't find it's explanation anywhere?

Answer 1

As per GATE exam concern , you don't need to.

But time complexity might ask in some questions.

Answer 2

Strassen’s Algorithm is an efficient algorithm to multiply two matrices. A simple method to multiply two matrices need 3 nested loops and is O(n^3). Strassen’s algorithm multiplies two matrices in O(n^2.8974) time.

You should know some stuffs, might be useful..