scientific article; zbMATH DE number 4201238

MaRDI QIDQ3349660zbMATH OpenFDO

Authors Roman Kolpakov

Publication date 1991

zbMATH Keywords

estimating complexity of the generationgeneration of rational numbers

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Foundations of probability theory (60A99) Circuits, networks (94C99)

Recommendations

• On complexity estimates for the generation of rational numbers by probabilistic contact -nets
• On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets
• A theory of computer rational numbers
• Generation of rational numbers by probabilistic contact π-networks
• Stochastic Algorithms: Foundations and Applications

Cited in

(10)

• On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets
• Algebras of probability distributions on finite sets
• On the bounds for the complexity of generation of rational numbers by stochastic contact \(\pi{}\)-networks
• On the generation of rational numbers by probabilistic contact nets
• On complexity estimates for the generation of rational numbers by probabilistic contact -nets
• A theory of computer rational numbers
• Generation of rational numbers by probabilistic contact π-networks
• scientific article; zbMATH DE number 1382432 (Why is no real title available?)
• Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
• scientific article; zbMATH DE number 741349 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3349660)