On the bounds for the complexity of generation of rational numbers by stochastic contact -networks

zbMATH Open0790.60004MaRDI QIDQ1803083FDOQ1803083

Roman Kolpakov

Publication date: 29 June 1993

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

zbMATH Keywords

complexityprobabilistic contact \(pi\)-netsspecial subsets of rational numbers

Mathematics Subject Classification ID

Foundations of probability theory (60A99)

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• On complexity estimates for the generation of rational numbers by probabilistic contact \(\pi\)-nets 👍 👎
• Generation of rational numbers by probabilistic contact π-networks 👍 👎
• On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets 👍 👎
• On the generation of rational numbers by probabilistic contact nets 👍 👎
• On the generation of rational numbers by probabilistic contact nets 👍 👎
• Title not available (Why is that?) 👍 👎
• On generation of some classes of rational numbers by probabilistic \(\pi\)- nets 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The arithmetical complexity of dimension and randomness 👍 👎

This page was built for publication: On the bounds for the complexity of generation of rational numbers by stochastic contact \(\pi{}\)-networks

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