Sub-Turing reducibilities of bounded complexity
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (1992), pp. 27-37.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{IVM_1992_1_a4,
     author = {V. K. Bulitko},
     title = {Sub-Turing reducibilities of bounded complexity},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {27--37},
     publisher = {mathdoc},
     number = {1},
     year = {1992},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1992_1_a4/}
}
TY  - JOUR
AU  - V. K. Bulitko
TI  - Sub-Turing reducibilities of bounded complexity
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1992
SP  - 27
EP  - 37
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1992_1_a4/
LA  - ru
ID  - IVM_1992_1_a4
ER  - 
%0 Journal Article
%A V. K. Bulitko
%T Sub-Turing reducibilities of bounded complexity
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1992
%P 27-37
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1992_1_a4/
%G ru
%F IVM_1992_1_a4
V. K. Bulitko. Sub-Turing reducibilities of bounded complexity. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (1992), pp. 27-37. http://geodesic.mathdoc.fr/item/IVM_1992_1_a4/