On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets (Q1279430)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets |
scientific article; zbMATH DE number 1256313
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets |
scientific article; zbMATH DE number 1256313 |
Statements
On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets (English)
0 references
11 July 1999
0 references
\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.
0 references
complexity estimates
0 references
generation of rational numbers
0 references
probabilistic series-parallel contact networks
0 references
