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, 1979, Volume 249, Number 4, Pages 793–796 (Mi dan43183)  
This article is cited in 1 scientific paper (total in 1 paper)

CYBERNETICS AND THE REGULATION THEORY

Polynomial estimation of the complexity of recognizing logical term equivalence

V. K. Sabelfeld

Computing Centre of Siberian Branch of the USSR Academy of Sciences, Novosibirsk
Full-text PDF (495 kB) Citations (1)
Presented: S. L. Sobolev
Received: 22.05.1979
Bibliographic databases:
Document Type: Article
UDC: 518.74
Language: Russian
Citation: V. K. Sabelfeld, “Polynomial estimation of the complexity of recognizing logical term equivalence”, Dokl. Akad. Nauk SSSR, 249:4 (1979), 793–796
Citation in format AMSBIB
\Bibitem{Sab79}
\by V.~K.~Sabelfeld
\paper Polynomial estimation of the complexity of recognizing logical term equivalence
\jour Dokl. Akad. Nauk SSSR
\yr 1979
\vol 249
\issue 4
\pages 793--796
\mathnet{http://mi.mathnet.ru/dan43183}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0570144}
Linking options:
  • https://www.mathnet.ru/eng/dan43183
  • https://www.mathnet.ru/eng/dan/v249/i4/p793
    • 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
    Statistics & downloads:
    Abstract page:111
    Full-text PDF :46
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024