Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2013, Volume 4, Issue 3, Pages 131–158
DOI: https://doi.org/10.4213/mvk95 (Mi mvk95) 		 
This article is cited in 2 scientific papers (total in 2 papers)

A modification of an algorithm for estimating the cardinality of integers with no more than three prime divisors

A. S. Rybakov

TPA Laboratory, Moscow
Full-text PDF (214 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk95
Abstract: We suggest fast computational methods for some generalizations of the Dickman function used to estimate the cardinality of the set of integers in an interval having no more than three prime divisors.
Key words: smooth and semi-smooth numbers, Dickman function, integral representations, quickly convergent series.
Received 20.IV.2012
Document Type: Article
UDC: 511.333
Language: Russian
Citation: A. S. Rybakov, “A modification of an algorithm for estimating the cardinality of integers with no more than three prime divisors”, Mat. Vopr. Kriptogr., 4:3 (2013), 131–158
Citation in format AMSBIB
\Bibitem{Ryb13}
\by A.~S.~Rybakov
\paper A modification of an algorithm for estimating the cardinality of integers with no more than three prime divisors
\jour Mat. Vopr. Kriptogr.
\yr 2013
\vol 4
\issue 3
\pages 131--158
\mathnet{http://mi.mathnet.ru/mvk95}
\crossref{https://doi.org/10.4213/mvk95}
Linking options:
  • https://www.mathnet.ru/eng/mvk95
  • https://doi.org/10.4213/mvk95
  • https://www.mathnet.ru/eng/mvk/v4/i3/p131
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:346
    Full-text PDF :244
    References:44
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024