Geodesic
Complexity of approximate solution of combinatorial problems
Doklady Akademii Nauk, Tome 224 (1975) no. 2, pp. 289-292.

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

@article{DAN_1975_224_2_a8,
     author = {R. G. Nigmatullin},
     title = {Complexity of approximate solution of combinatorial problems},
     journal = {Doklady Akademii Nauk},
     pages = {289--292},
     publisher = {mathdoc},
     volume = {224},
     number = {2},
     year = {1975},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1975_224_2_a8/}
}
TY  - JOUR
AU  - R. G. Nigmatullin
TI  - Complexity of approximate solution of combinatorial problems
JO  - Doklady Akademii Nauk
PY  - 1975
SP  - 289
EP  - 292
VL  - 224
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1975_224_2_a8/
LA  - ru
ID  - DAN_1975_224_2_a8
ER  - 
%0 Journal Article
%A R. G. Nigmatullin
%T Complexity of approximate solution of combinatorial problems
%J Doklady Akademii Nauk
%D 1975
%P 289-292
%V 224
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1975_224_2_a8/
%G ru
%F DAN_1975_224_2_a8
R. G. Nigmatullin. Complexity of approximate solution of combinatorial problems. Doklady Akademii Nauk, Tome 224 (1975) no. 2, pp. 289-292. http://geodesic.mathdoc.fr/item/DAN_1975_224_2_a8/