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, 1970, Volume 190, Number 1, Pages 23–26 (Mi dan35117)  
This article is cited in 1 scientific paper (total in 1 paper)

MATHEMATICS

The complexity of the enumeration and solvability of predicates

M. I. Kanovich

Lomonosov Moscow State University
Full-text PDF (535 kB) Citations (1)
Presented: P. S. Novikov
Received: 15.05.1969
Bibliographic databases:
Document Type: Article
UDC: 517.11
Language: Russian
Citation: M. I. Kanovich, “The complexity of the enumeration and solvability of predicates”, Dokl. Akad. Nauk SSSR, 190:1 (1970), 23–26
Citation in format AMSBIB
\Bibitem{Kan70}
\by M.~I.~Kanovich
\paper The complexity of the enumeration and solvability of predicates
\jour Dokl. Akad. Nauk SSSR
\yr 1970
\vol 190
\issue 1
\pages 23--26
\mathnet{http://mi.mathnet.ru/dan35117}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0262084}
\zmath{https://zbmath.org/?q=an:0255.02049}
Linking options:
  • https://www.mathnet.ru/eng/dan35117
  • https://www.mathnet.ru/eng/dan/v190/i1/p23
    • 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:116
    Full-text PDF :57
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024