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


Dokl. Akad. Nauk SSSR, 1970, Volume 191, Number 5, Pages 1004–1006 (Mi dan35341)  

MATHEMATICS

The complexity of the algorithms that are connected with the realization of logico-arithmetical and propositional formulae

V. I. Khomich

Lomonosov Moscow State University

Full text: PDF file (438 kB)

Bibliographic databases:
UDC: 517.11
Presented: П. С. Новиков
Received: 04.09.1969

Citation: V. I. Khomich, “The complexity of the algorithms that are connected with the realization of logico-arithmetical and propositional formulae”, Dokl. Akad. Nauk SSSR, 191:5 (1970), 1004–1006

Citation in format AMSBIB
\Bibitem{Kho70}
\by V.~I.~Khomich
\paper The complexity of the algorithms that are connected with the realization of logico-arithmetical and propositional formulae
\jour Dokl. Akad. Nauk SSSR
\yr 1970
\vol 191
\issue 5
\pages 1004--1006
\mathnet{http://mi.mathnet.ru/dan35341}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=0265163}
\zmath{https://zbmath.org/?q=an:0212.33202}


Linking options:
  • http://mi.mathnet.ru/eng/dan35341
  • http://mi.mathnet.ru/eng/dan/v191/i5/p1004

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:34
    Full text:34

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020