Science.Online
Search
Publisher and Institutes
Akademie Verlag
Deutsches Institut für Urbanistik
Oldenbourg Wissenschaftsverlag
Walter de Gruyter
Schattauer
You are here: Home :: Area NEM :: Mathematics
 
D. A. Kuropatkin

A probabilistic algorithm for finding the term rank of non-negative matrices

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.

Discrete Mathematics and Applications, Walter de Gruyter

Print ISSN: 0924-9266
Volume: 15, 04/2005
Pages: 171 - 177

Show full article (external site)

Show all available items of this journal