Geodesic
On lower and upper estimates for the complexity of the terms of constructive sequences of normal algorithms
Doklady Akademii Nauk, Tome 228 (1976) no. 5, pp. 1029-1030.

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

@article{DAN_1976_228_5_a3,
     author = {V. G. Zharov},
     title = {On lower and upper estimates for the complexity of the terms of constructive sequences of normal algorithms},
     journal = {Doklady Akademii Nauk},
     pages = {1029--1030},
     publisher = {mathdoc},
     volume = {228},
     number = {5},
     year = {1976},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1976_228_5_a3/}
}
TY  - JOUR
AU  - V. G. Zharov
TI  - On lower and upper estimates for the complexity of the terms of constructive sequences of normal algorithms
JO  - Doklady Akademii Nauk
PY  - 1976
SP  - 1029
EP  - 1030
VL  - 228
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1976_228_5_a3/
LA  - ru
ID  - DAN_1976_228_5_a3
ER  - 
%0 Journal Article
%A V. G. Zharov
%T On lower and upper estimates for the complexity of the terms of constructive sequences of normal algorithms
%J Doklady Akademii Nauk
%D 1976
%P 1029-1030
%V 228
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1976_228_5_a3/
%G ru
%F DAN_1976_228_5_a3
V. G. Zharov. On lower and upper estimates for the complexity of the terms of constructive sequences of normal algorithms. Doklady Akademii Nauk, Tome 228 (1976) no. 5, pp. 1029-1030. http://geodesic.mathdoc.fr/item/DAN_1976_228_5_a3/