Based on Wikipedia information, the computational complexity of multiplying two $n\times n$ matrices can be $\mathcal{O}(n^{2.37})$ using algorithms similar to Coppersmith–Winograd.
I wonder what if we want to multiply a $n\times m$ matrix by a $m\times p$ matrix? Is there any algorithm providing a more efficient complexity than $\mathcal{O}(nmp)$?