On the complexity of nonnegative matrix factorization