Math, asked by dadhichraissa1872, 11 months ago

Given two n x n matrices, what is the lowest bound of the exponent in the computational complexity of their product?

Answers

Answered by raolkashyap
0

don't know the answer sorry

Similar questions