Geodesic
On the complexity of the problem of separating recursively enumerable sets
Doklady Akademii Nauk, Tome 267 (1982) no. 6, pp. 1300-1304.

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

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