No CrossRef data available.
Published online by Cambridge University Press: 27 July 2009
Known results in random graph theory lead easily to a quantitative result on the number of multiplications needed in a matrix factorization algorithm, under the assumption that non-zero entries are randomly distributed.