|
A probabilistic algorithm for finding the term rank of a nonnegative matrix
D. A. Kuropatkin
Abstract:
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.
Received: 11.03.2004
Citation:
D. A. Kuropatkin, “A probabilistic algorithm for finding the term rank of a nonnegative matrix”, Diskr. Mat., 17:1 (2005), 147–156; Discrete Math. Appl., 15:2 (2005), 171–177
Linking options:
https://www.mathnet.ru/eng/dm94https://doi.org/10.4213/dm94 https://www.mathnet.ru/eng/dm/v17/i1/p147
|
Statistics & downloads: |
Abstract page: | 500 | Full-text PDF : | 263 | References: | 41 | First page: | 1 |
|