Geodesic
Algorithms, optimal with respect to complexity, for the approximate solution of integral equations
Differencialʹnye uravneniâ, Tome 34 (1998) no. 9, pp. 1240-1245 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DE_1998_34_9_a10,
     author = {I. V. Boykov},
     title = {Algorithms, optimal with respect to complexity, for the approximate solution of integral equations},
     journal = {Differencialʹnye uravneni\^a},
     pages = {1240--1245},
     year = {1998},
     volume = {34},
     number = {9},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DE_1998_34_9_a10/}
}
TY  - JOUR
AU  - I. V. Boykov
TI  - Algorithms, optimal with respect to complexity, for the approximate solution of integral equations
JO  - Differencialʹnye uravneniâ
PY  - 1998
SP  - 1240
EP  - 1245
VL  - 34
IS  - 9
UR  - http://geodesic.mathdoc.fr/item/DE_1998_34_9_a10/
LA  - ru
ID  - DE_1998_34_9_a10
ER  - 
%0 Journal Article
%A I. V. Boykov
%T Algorithms, optimal with respect to complexity, for the approximate solution of integral equations
%J Differencialʹnye uravneniâ
%D 1998
%P 1240-1245
%V 34
%N 9
%U http://geodesic.mathdoc.fr/item/DE_1998_34_9_a10/
%G ru
%F DE_1998_34_9_a10
I. V. Boykov. Algorithms, optimal with respect to complexity, for the approximate solution of integral equations. Differencialʹnye uravneniâ, Tome 34 (1998) no. 9, pp. 1240-1245. http://geodesic.mathdoc.fr/item/DE_1998_34_9_a10/