Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Dynamic Programming
According to Strassen matrix multiplication algorithm which of the following is correct time complexity to multiply two matrices each of size n X n?
1
O(n2)
2
O(n1.81)
3
O(n2.81)
4
O(n3)