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, 1985, Volume 282, Number 6, Pages 1299–1303 (Mi dan9098)  
MATHEMATICS

The existence of a “most complex” problem in the class of problems verifiable in nonpolynomial time

A. K. Kel'mans

Institute of Control Sciences, Moscow
Full-text PDF (795 kB)
Presented: L. V. Kantorovich
Received: 14.08.1984
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. K. Kel'mans, “The existence of a “most complex” problem in the class of problems verifiable in nonpolynomial time”, Dokl. Akad. Nauk SSSR, 282:6 (1985), 1299–1303
Citation in format AMSBIB
\Bibitem{Kel85}
\by A.~K.~Kel'mans
\paper The existence of a ``most complex'' problem in the class of
problems verifiable in nonpolynomial time
\jour Dokl. Akad. Nauk SSSR
\yr 1985
\vol 282
\issue 6
\pages 1299--1303
\mathnet{http://mi.mathnet.ru/dan9098}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=802693}
\zmath{https://zbmath.org/?q=an:0616.68048}
Linking options:
  • https://www.mathnet.ru/eng/dan9098
  • https://www.mathnet.ru/eng/dan/v282/i6/p1299
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:89
    Full-text PDF :32
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024