Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
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


Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 1992, Number 1, Pages 27–37 (Mi ivm4597)  
This article is cited in 2 scientific papers (total in 2 papers)

Sub-Turing reducibilities of bounded complexity

V. K. Bulitko

Odessa
Full-text PDF (809 kB) Citations (2)
Received: 14.01.1991
Bibliographic databases:
UDC: 510.540
Language: Russian
Citation: V. K. Bulitko, “Sub-Turing reducibilities of bounded complexity”, Izv. Vyssh. Uchebn. Zaved. Mat., 1992, no. 1, 27–37; Russian Math. (Iz. VUZ), 36:1 (1992), 25–36
Citation in format AMSBIB
\Bibitem{Bul92}
\by V.~K.~Bulitko
\paper Sub-Turing reducibilities of bounded complexity
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 1992
\issue 1
\pages 27--37
\mathnet{http://mi.mathnet.ru/ivm4597}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1205035}
\zmath{https://zbmath.org/?q=an:0804.03030}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 1992
\vol 36
\issue 1
\pages 25--36
Linking options:
  • https://www.mathnet.ru/eng/ivm4597
  • https://www.mathnet.ru/eng/ivm/y1992/i1/p27
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
    Statistics & downloads:
    Abstract page:137
    Full-text PDF :53
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024