Geodesic
Lower bound for the number of iterations for a class of truncation algorithms
Diskretnyj analiz i issledovanie operacij, no. 23 (1983), pp. 64-69.

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

@article{DA_1983_23_a6,
     author = {A. A. Kolokolov},
     title = {Lower bound for the number of iterations for a class of truncation algorithms},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {64--69},
     publisher = {mathdoc},
     number = {23},
     year = {1983},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1983_23_a6/}
}
TY  - JOUR
AU  - A. A. Kolokolov
TI  - Lower bound for the number of iterations for a class of truncation algorithms
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1983
SP  - 64
EP  - 69
IS  - 23
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1983_23_a6/
LA  - ru
ID  - DA_1983_23_a6
ER  - 
%0 Journal Article
%A A. A. Kolokolov
%T Lower bound for the number of iterations for a class of truncation algorithms
%J Diskretnyj analiz i issledovanie operacij
%D 1983
%P 64-69
%N 23
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1983_23_a6/
%G ru
%F DA_1983_23_a6
A. A. Kolokolov. Lower bound for the number of iterations for a class of truncation algorithms. Diskretnyj analiz i issledovanie operacij, no. 23 (1983), pp. 64-69. http://geodesic.mathdoc.fr/item/DA_1983_23_a6/