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
Best complexity bound for parallel matrix-vector product?
dc.parallel comp;matrices;matrix product;parallel