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, 1969, Volume 186, Number 5, Pages 1008–1009 (Mi dan34682)  
This article is cited in 1 scientific paper (total in 1 paper)

MATHEMATICS

The complexity of the reduction of algorithms

M. I. Kanovich

Lomonosov Moscow State University
Full-text PDF (307 kB) Citations (1)
Presented: P. S. Novikov
Received: 12.10.1968
Bibliographic databases:
Document Type: Article
UDC: 51.01:518.5
Language: Russian
Citation: M. I. Kanovich, “The complexity of the reduction of algorithms”, Dokl. Akad. Nauk SSSR, 186:5 (1969), 1008–1009
Citation in format AMSBIB
\Bibitem{Kan69}
\by M.~I.~Kanovich
\paper The complexity of the reduction of algorithms
\jour Dokl. Akad. Nauk SSSR
\yr 1969
\vol 186
\issue 5
\pages 1008--1009
\mathnet{http://mi.mathnet.ru/dan34682}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0262082}
\zmath{https://zbmath.org/?q=an:0272.02054}
Linking options:
  • https://www.mathnet.ru/eng/dan34682
  • https://www.mathnet.ru/eng/dan/v186/i5/p1008
    • 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
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024