Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2017, Volume 57, Number 4, Pages 730–743
DOI: https://doi.org/10.7868/S0044466917040123 (Mi zvmmf10566) 		 
On relationships between complexity classes of Turing machines

V. N. Zakharov, V. A. Kozmidiadi

Federal Research Center Computer Science and Control, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (162 kB)
References:
PDF
HTML
DOI: https://doi.org/10.7868/S0044466917040123
Abstract: Classes of time and space complexity of Turing machines are defined, and relationships between them are discussed. New relationships between the defined complexity classes are described.
Key words: $P$ vs $\mathbf{NP}$ problem, $\mathbf{DSPACE}(|X|^n)$ vs $\mathbf{NSPACE}(|X|^n)$, polynomial reducibility (Karp reducibility), $\mathbf{NP}$-complete Turing machines, theory of computational complexity, deterministic Turing machines, nondeterministic Turing machines.
Received: 07.07.2016
Revised: 06.09.2016
English version:
Computational Mathematics and Mathematical Physics, 2017, Volume 57, Issue 4, Pages 726–738
DOI: https://doi.org/10.1134/S096554251704011X
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: V. N. Zakharov, V. A. Kozmidiadi, “On relationships between complexity classes of Turing machines”, Zh. Vychisl. Mat. Mat. Fiz., 57:4 (2017), 730–743; Comput. Math. Math. Phys., 57:4 (2017), 726–738
Citation in format AMSBIB
\Bibitem{ZakKoz17}
\by V.~N.~Zakharov, V.~A.~Kozmidiadi
\paper On relationships between complexity classes of Turing machines
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2017
\vol 57
\issue 4
\pages 730--743
\mathnet{http://mi.mathnet.ru/zvmmf10566}
\crossref{https://doi.org/10.7868/S0044466917040123}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3651125}
\elib{https://elibrary.ru/item.asp?id=29331728}
\transl
\jour Comput. Math. Math. Phys.
\yr 2017
\vol 57
\issue 4
\pages 726--738
\crossref{https://doi.org/10.1134/S096554251704011X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000401560700012}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85019607576}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf10566
  • https://www.mathnet.ru/eng/zvmmf/v57/i4/p730
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Statistics & downloads:
    Abstract page:241
    Full-text PDF :173
    References:40
    First page:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024