Is there any method for multiplying matrices having O(n) complexity?

Question

I want to multiply two matrices but the triple loop has O(n³) complexity. Is there any algorithm in dynamic programming to multiply two matrices with O(n) complexity?

Answer 1

Matrices have O(n²) elements, and every element must be considered at least once for the result, so there is no possible way for a matrix multiplication algorithm to run in less than O(n²) operations.