The FFLAS project has established that exact matrix multiplication
over finite fields can be performed at the speed of the highly
optimized numerical BLAS routines.
Since many algorithms have been reduced to use
matrix multiplication in order to be able to prove an optimal
theoretical complexity, this paper shows that those optimal complexity
algorithms, such as LSP factorization, rank determinant and inverse
computation can also be the most efficient.