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

D. A. Kuropatkin

doi:10.1515/dma-2005-150206

40% Rabatt

auf Fachbücher bei De Gruyter Brill *

Mit dem Code

DGBHOLIDAY40

Gültig bis zum 11. Dezember

* Es gelten die Aktionsbedingungen

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

Artikel

Lizenziert

Nicht lizenziert Erfordert eine Authentifizierung

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

D. A. Kuropatkin

Veröffentlicht/Copyright: 2. November 2023

Veröffentlicht von

Veröffentlichen auch Sie bei De Gruyter Brill

Informationen für Autor*innen Erkunden Sie dieses Fachgebiet

Aus der Zeitschrift Discrete Mathematics and Applications Band 15 Heft 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

Kopie

In die Zwischenablage kopiert

BibTeX EndNote RIS

Published Online: 2023-11-02

Published in Print: 2005-03-01

Sie haben derzeit keinen Zugang zu diesem Inhalt.

Artikel in diesem Heft

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

Zeitschrift durchsuchen In dieser Zeitschrift suchen

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

Artikel in diesem Heft

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