On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets

zbMath0915.94015MaRDI QIDQ1279430

Roman M. Kolpakov

Publication date: 11 July 1999

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

complexity estimatesgeneration of rational numbersprobabilistic series-parallel contact networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Circuits, networks (94C99) Complexity of computation (including implicit computational complexity) (03D15) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)

This page was built for publication: On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets