A probabilistic algorithm for finding the term rank of a nonnegative matrix

We suggest a probabilistic algorithm for finding the term rank of a matrix with non-negative elements, find an estimate of the complexity of the algorithm, and establish an upper bound for the probability of finding a wrong value of the term rank.