# Best complexity bound for parallel matrix-vector product?

I'm looking for the best known complexity (and a bound for the number of processors invoved) to do the calculation of a $(n,n)$ matrix-vector product.

Thank you

• Is that of theoretical or of practical importance for you? (I do not know the answer to the question) – babou Feb 27 '14 at 10:55