Given two n x n matrices, what is the lowest bound of the exponent in the computational complexity of their product?
Answers
Answered by
0
don't know the answer sorry
Similar questions