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, 1977, Volume 232, Number 2, Pages 273–276 (Mi dan40861)  
MATHEMATICS

Complexity of complete systems of equivalent transformations in programming languages

M. I. Kanovich

Kalininsky State University
Full-text PDF (645 kB)
Presented: A. A. Dorodnitsyn
Received: 04.08.1976
Bibliographic databases:
Document Type: Article
UDC: 517.11:518.5
Language: Russian
Citation: M. I. Kanovich, “Complexity of complete systems of equivalent transformations in programming languages”, Dokl. Akad. Nauk SSSR, 232:2 (1977), 273–276
Citation in format AMSBIB
\Bibitem{Kan77}
\by M.~I.~Kanovich
\paper Complexity of complete systems of equivalent transformations in programming languages
\jour Dokl. Akad. Nauk SSSR
\yr 1977
\vol 232
\issue 2
\pages 273--276
\mathnet{http://mi.mathnet.ru/dan40861}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0436660}
\zmath{https://zbmath.org/?q=an:0373.68014}
Linking options:
  • https://www.mathnet.ru/eng/dan40861
  • https://www.mathnet.ru/eng/dan/v232/i2/p273
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:110
    Full-text PDF :51
    References:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024