On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets
type: Item
instance of: scholarly article
title: On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets
zbMATH Open document ID: 0915.94015
published in: Moscow University Mathematics Bulletin
publication date: 1999-07-11T00:00:00Z
review text: \textit{R. L. Shirtladze} [Soobshch. Akad Nauk Gruz. SSR 26, No. 2, 181-186 (1961; Zbl 0115.35102)] and \textit{F. I. Salimov} [Veroyatn. Metody Kibern. Kazan' 15, 68-89 (1979; Zbl 0432.60006)] have found some complexity estimates for the generation of rational numbers from the interval \((0,1)\) by finite subsets, using operations over random variables. The author extends this study and improves some of his previous results [ibid. 2, 27-30 (1992); Diskretn. Mat. 6, No. 3, 18-38 (1994; Zbl 0820.94030)], giving an interpretation in terms of probabilistic series-parallel contact networks.
reviewed by: Indulis Strazdins
Mathematics Subject Classification ID: 94C99
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 11K99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1256313
zbMATH Keywords: complexity estimates
zbMATH Keywords: generation of rational numbers
zbMATH Keywords: probabilistic series-parallel contact networks
author: Roman Kolpakov
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1256313