On the asymptotic complexity of rectangular matrix multiplication

The number of essential multiplications required to multiply matrices of size NxN and NxN?x is studied as a function f(x). Bounds to f(x) sharper than trivial ones are presented and the asymptotic behaviour of f(x) is studied. An analogous investigation is performed for the problem of multiplying matrices of size NxN?x and N?xxN?y.