Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk SSSR, 1976, Volume 228, Number 5, Pages 1029–1030 (Mi dan40145)  
MATHEMATICS

On lower and upper estimates for the complexity of the terms of constructive sequences of normal algorithms

V. G. Zharov

Lomonosov Moscow State University
Full-text PDF (286 kB)
Presented: A. A. Dorodnitsyn
Received: 19.01.1976
Bibliographic databases:
Document Type: Article
UDC: 517.11
Language: Russian
Citation: V. G. Zharov, “On lower and upper estimates for the complexity of the terms of constructive sequences of normal algorithms”, Dokl. Akad. Nauk SSSR, 228:5 (1976), 1029–1030
Citation in format AMSBIB
\Bibitem{Zha76}
\by V.~G.~Zharov
\paper On lower and upper estimates for the complexity of the terms of constructive sequences of normal algorithms
\jour Dokl. Akad. Nauk SSSR
\yr 1976
\vol 228
\issue 5
\pages 1029--1030
\mathnet{http://mi.mathnet.ru/dan40145}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0464707}
\zmath{https://zbmath.org/?q=an:0362.68078}
Linking options:
  • https://www.mathnet.ru/eng/dan40145
  • https://www.mathnet.ru/eng/dan/v228/i5/p1029
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:140
    Full-text PDF :65
    References:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025