Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 1995, Number 5, Pages 99–102 (Mi vmumm2177)  
This article is cited in 1 scientific paper (total in 1 paper)

Short notes

On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets

R. M. Kolpakov
Full-text PDF (479 kB) Citations (1)
Received: 14.12.1994
Bibliographic databases:
Document Type: Article
UDC: 519.714.2
Language: Russian
Citation: R. M. Kolpakov, “On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995, no. 5, 99–102
Citation in format AMSBIB
\Bibitem{Kol95}
\by R.~M.~Kolpakov
\paper On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 1995
\issue 5
\pages 99--102
\mathnet{http://mi.mathnet.ru/vmumm2177}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1376132}
\zmath{https://zbmath.org/?q=an:0915.94015}
Linking options:
  • https://www.mathnet.ru/eng/vmumm2177
  • https://www.mathnet.ru/eng/vmumm/y1995/i5/p99
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:39
    Full-text PDF :18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024