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


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




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

Diskretnaya Matematika, 1990, Volume 2, Issue 3, Pages 50–55 (Mi dm868)  
Complexity of self-correcting algorithms for two search problems

V. V. Morozenko
Full-text PDF (780 kB)
Received: 12.09.1989
Bibliographic databases:
UDC: 519.712, 519.718.3
Language: Russian
Citation: V. V. Morozenko, “Complexity of self-correcting algorithms for two search problems”, Diskr. Mat., 2:3 (1990), 50–55
Citation in format AMSBIB
\Bibitem{Mor90}
\by V.~V.~Morozenko
\paper Complexity of self-correcting algorithms for two search problems
\jour Diskr. Mat.
\yr 1990
\vol 2
\issue 3
\pages 50--55
\mathnet{http://mi.mathnet.ru/dm868}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1084066}
\zmath{https://zbmath.org/?q=an:0725.68056}
Linking options:
  • https://www.mathnet.ru/eng/dm868
  • https://www.mathnet.ru/eng/dm/v2/i3/p50
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:305
    Full-text PDF :104
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024