What is the time complexity of the fastest known matrix multiplication algorithm?
(a) O(n^log7)
(b) O(n^2.37)
(c) O(n^3)
(d) O(n!)
This question was addressed to me during an interview.
I need to ask this question from Recursion topic in division Recursion of Data Structures & Algorithms II