Geodesic
Complexity properties of recursively enumerable sets and $bsQ$-completeness
Matematičeskie zametki, Tome 68 (2000) no. 4, pp. 554-559

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

@article{MZM_2000_68_4_a6,
     author = {R. Sh. Omanadze},
     title = {Complexity properties of recursively enumerable sets and $bsQ$-completeness},
     journal = {Matemati\v{c}eskie zametki},
     pages = {554--559},
     publisher = {mathdoc},
     volume = {68},
     number = {4},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2000_68_4_a6/}
}
TY  - JOUR
AU  - R. Sh. Omanadze
TI  - Complexity properties of recursively enumerable sets and $bsQ$-completeness
JO  - Matematičeskie zametki
PY  - 2000
SP  - 554
EP  - 559
VL  - 68
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2000_68_4_a6/
LA  - ru
ID  - MZM_2000_68_4_a6
ER  - 
%0 Journal Article
%A R. Sh. Omanadze
%T Complexity properties of recursively enumerable sets and $bsQ$-completeness
%J Matematičeskie zametki
%D 2000
%P 554-559
%V 68
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2000_68_4_a6/
%G ru
%F MZM_2000_68_4_a6
R. Sh. Omanadze. Complexity properties of recursively enumerable sets and $bsQ$-completeness. Matematičeskie zametki, Tome 68 (2000) no. 4, pp. 554-559. http://geodesic.mathdoc.fr/item/MZM_2000_68_4_a6/