Zapiski Nauchnykh Seminarov POMI
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


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov POMI, 2001, Volume 277, Pages 5–13 (Mi znsl1426)  
This article is cited in 1 scientific paper (total in 1 paper)

Combined hierarchies of finite random access machines

A. P. Beltiukov

Udmurt State University
Full-text PDF (146 kB) Citations (1)
Abstract: A finitary approach to the computational complexity theory is considered in the article. Classes of finite random access machines are investigated. Combined space-and-time computational complexity hierarchies of predicates (properties, sets) recognizable by these machines are built. The corresponding theorem is proved.
Received: 29.04.2001
English version:
Journal of Mathematical Sciences (New York), 2003, Volume 118, Issue 2, Pages 4943–4947
DOI: https://doi.org/10.1023/A:1025633804935
Bibliographic databases:
UDC: 510
Language: Russian
Citation: A. P. Beltiukov, “Combined hierarchies of finite random access machines”, Computational complexity theory. Part VI, Zap. Nauchn. Sem. POMI, 277, POMI, St. Petersburg, 2001, 5–13; J. Math. Sci. (N. Y.), 118:2 (2003), 4943–4947
Citation in format AMSBIB
\Bibitem{Bel01}
\by A.~P.~Beltiukov
\paper Combined hierarchies of finite random access machines
\inbook Computational complexity theory. Part~VI
\serial Zap. Nauchn. Sem. POMI
\yr 2001
\vol 277
\pages 5--13
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl1426}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1865894}
\zmath{https://zbmath.org/?q=an:1076.68029}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2003
\vol 118
\issue 2
\pages 4943--4947
\crossref{https://doi.org/10.1023/A:1025633804935}
Linking options:
  • https://www.mathnet.ru/eng/znsl1426
  • https://www.mathnet.ru/eng/znsl/v277/p5
    • 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:259
    Full-text PDF :98
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024