Prikladnaya Diskretnaya Matematika
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


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2010, supplement № 3, Pages 88–90 (Mi pdm211)  
Computational Methods in Discrete Mathematics

Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces

I. V. Pankratov, O. A. Teploukhova

Moscow
Full-text PDF (341 kB)
Abstract: Some upper bounds are given for the complexity of enumerating elements in non-uniformly distributed key spaces.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: I. V. Pankratov, O. A. Teploukhova, “Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces”, Prikl. Diskr. Mat., 2010, supplement № 3, 88–90
Citation in format AMSBIB
\Bibitem{PanTep10}
\by I.~V.~Pankratov, O.~A.~Teploukhova
\paper Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces
\jour Prikl. Diskr. Mat.
\yr 2010
\pages 88--90
\issueinfo supplement № 3
\mathnet{http://mi.mathnet.ru/pdm211}
Linking options:
  • https://www.mathnet.ru/eng/pdm211
  • https://www.mathnet.ru/eng/pdm/y2010/i12/p88
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:143
    Full-text PDF :61
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024