A 5/2n/sup 2/-lower bound for the rank of n/spl times/n-matrix multiplication over arbitrary fields | IEEE Conference Publication | IEEE Xplore