Geodesic
The complexity of the solution of recursively enumerable sets
Doklady Akademii Nauk, Tome 192 (1970) no. 4, pp. 721-723.

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

@article{DAN_1970_192_4_a3,
     author = {M. I. Kanovitch},
     title = {The complexity of the solution of recursively enumerable sets},
     journal = {Doklady Akademii Nauk},
     pages = {721--723},
     publisher = {mathdoc},
     volume = {192},
     number = {4},
     year = {1970},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1970_192_4_a3/}
}
TY  - JOUR
AU  - M. I. Kanovitch
TI  - The complexity of the solution of recursively enumerable sets
JO  - Doklady Akademii Nauk
PY  - 1970
SP  - 721
EP  - 723
VL  - 192
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1970_192_4_a3/
LA  - ru
ID  - DAN_1970_192_4_a3
ER  - 
%0 Journal Article
%A M. I. Kanovitch
%T The complexity of the solution of recursively enumerable sets
%J Doklady Akademii Nauk
%D 1970
%P 721-723
%V 192
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1970_192_4_a3/
%G ru
%F DAN_1970_192_4_a3
M. I. Kanovitch. The complexity of the solution of recursively enumerable sets. Doklady Akademii Nauk, Tome 192 (1970) no. 4, pp. 721-723. http://geodesic.mathdoc.fr/item/DAN_1970_192_4_a3/