Geodesic
The complexity of the terms of constructive sequences of normal algorithms
Doklady Akademii Nauk, Tome 203 (1972) no. 4, pp. 746-748.

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

@article{DAN_1972_203_4_a3,
     author = {V. G. Zharov},
     title = {The complexity of the terms of constructive sequences of normal algorithms},
     journal = {Doklady Akademii Nauk},
     pages = {746--748},
     publisher = {mathdoc},
     volume = {203},
     number = {4},
     year = {1972},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1972_203_4_a3/}
}
TY  - JOUR
AU  - V. G. Zharov
TI  - The complexity of the terms of constructive sequences of normal algorithms
JO  - Doklady Akademii Nauk
PY  - 1972
SP  - 746
EP  - 748
VL  - 203
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1972_203_4_a3/
LA  - ru
ID  - DAN_1972_203_4_a3
ER  - 
%0 Journal Article
%A V. G. Zharov
%T The complexity of the terms of constructive sequences of normal algorithms
%J Doklady Akademii Nauk
%D 1972
%P 746-748
%V 203
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1972_203_4_a3/
%G ru
%F DAN_1972_203_4_a3
V. G. Zharov. The complexity of the terms of constructive sequences of normal algorithms. Doklady Akademii Nauk, Tome 203 (1972) no. 4, pp. 746-748. http://geodesic.mathdoc.fr/item/DAN_1972_203_4_a3/