Geodesic
Reducibilities of tabular type in the theory of algorithms
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 34 (1979) no. 3, pp. 155-192

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

@article{RM_1979_34_3_a2,
     author = {A. N. Degtev},
     title = {Reducibilities of tabular type in the theory of algorithms},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {155--192},
     publisher = {mathdoc},
     volume = {34},
     number = {3},
     year = {1979},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_1979_34_3_a2/}
}
TY  - JOUR
AU  - A. N. Degtev
TI  - Reducibilities of tabular type in the theory of algorithms
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 1979
SP  - 155
EP  - 192
VL  - 34
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/RM_1979_34_3_a2/
LA  - en
ID  - RM_1979_34_3_a2
ER  - 
%0 Journal Article
%A A. N. Degtev
%T Reducibilities of tabular type in the theory of algorithms
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 1979
%P 155-192
%V 34
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/RM_1979_34_3_a2/
%G en
%F RM_1979_34_3_a2
A. N. Degtev. Reducibilities of tabular type in the theory of algorithms. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 34 (1979) no. 3, pp. 155-192. http://geodesic.mathdoc.fr/item/RM_1979_34_3_a2/