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




Doklady Akademii 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 (438 kB)
Presented: P. S. Novikov
Received: 04.09.1969
Bibliographic databases:
Document Type: Article
UDC: 517.11
Language: Russian
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{https://mathscinet.ams.org/mathscinet-getitem?mr=0265163}
\zmath{https://zbmath.org/?q=an:0212.33202}
Linking options:
  • https://www.mathnet.ru/eng/dan35341
  • https://www.mathnet.ru/eng/dan/v191/i5/p1004
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:200
    Full-text PDF :94
    References:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025