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

D. A. Kuropatkin

doi:10.1515/dma-2005-150206

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

Article

Licensed

Unlicensed Requires Authentication

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

D. A. Kuropatkin

Published/Copyright: November 2, 2023

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

From the journal Discrete Mathematics and Applications Volume 15 Issue 2

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

Kuropatkin, D. A.. "A probabilistic algorithm for finding the term rank of non-negative matrices" Discrete Mathematics and Applications, vol. 15, no. 2, 2005, pp. 171-178. https://doi.org/10.1515/dma-2005-150206

Kuropatkin, D. (2005). A probabilistic algorithm for finding the term rank of non-negative matrices. Discrete Mathematics and Applications, 15(2), 171-178. https://doi.org/10.1515/dma-2005-150206

Kuropatkin, D. (2005) A probabilistic algorithm for finding the term rank of non-negative matrices. Discrete Mathematics and Applications, Vol. 15 (Issue 2), pp. 171-178. https://doi.org/10.1515/dma-2005-150206

Kuropatkin, D. A.. "A probabilistic algorithm for finding the term rank of non-negative matrices" Discrete Mathematics and Applications 15, no. 2 (2005): 171-178. https://doi.org/10.1515/dma-2005-150206

Kuropatkin D. A probabilistic algorithm for finding the term rank of non-negative matrices. Discrete Mathematics and Applications. 2005;15(2): 171-178. https://doi.org/10.1515/dma-2005-150206

Copy

Copied to clipboard

BibTeX EndNote RIS

Published Online: 2023-11-02

Published in Print: 2005-03-01

You are currently not able to access this content.

Articles in the same Issue

Masthead
Convergence in distribution of random mappings of finite sets to branching processes
Calculation of moments of combinatorial statistics of symmetrically dependent random variables
Approximation of moments of arbitrary integer orders by generalised factorial powers
Random sequences of the form X_t+1=a_tX_t+b_t modulo n with dependent coefficients a_t, b_t
Limit theorems on sizes of trees in a random unlabelled forest
A probabilistic algorithm for finding the term rank of non-negative matrices
Homomorphisms of binary shift registers
Optimisation in Boolean-valued networks
On generalisations of the notion of semirecursiveness
On stable and unstable trees
CONTENTS

Search journal Search the content of this journal

https://doi.org/10.1515/dma-2005-150206

Articles in the same Issue

Masthead
Convergence in distribution of random mappings of finite sets to branching processes
Calculation of moments of combinatorial statistics of symmetrically dependent random variables
Approximation of moments of arbitrary integer orders by generalised factorial powers
Random sequences of the form X_t+1=a_tX_t+b_t modulo n with dependent coefficients a_t, b_t
Limit theorems on sizes of trees in a random unlabelled forest
A probabilistic algorithm for finding the term rank of non-negative matrices
Homomorphisms of binary shift registers
Optimisation in Boolean-valued networks
On generalisations of the notion of semirecursiveness
On stable and unstable trees
CONTENTS