Geodesic
Estimates for the complexity of combinatorial optimization
Doklady Akademii Nauk, Tome 328 (1993) no. 1, pp. 22-24.

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

@article{DAN_1993_328_1_a4,
     author = {V. A. Bondarenko},
     title = {Estimates for the complexity of combinatorial optimization},
     journal = {Doklady Akademii Nauk},
     pages = {22--24},
     publisher = {mathdoc},
     volume = {328},
     number = {1},
     year = {1993},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1993_328_1_a4/}
}
TY  - JOUR
AU  - V. A. Bondarenko
TI  - Estimates for the complexity of combinatorial optimization
JO  - Doklady Akademii Nauk
PY  - 1993
SP  - 22
EP  - 24
VL  - 328
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1993_328_1_a4/
LA  - ru
ID  - DAN_1993_328_1_a4
ER  - 
%0 Journal Article
%A V. A. Bondarenko
%T Estimates for the complexity of combinatorial optimization
%J Doklady Akademii Nauk
%D 1993
%P 22-24
%V 328
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1993_328_1_a4/
%G ru
%F DAN_1993_328_1_a4
V. A. Bondarenko. Estimates for the complexity of combinatorial optimization. Doklady Akademii Nauk, Tome 328 (1993) no. 1, pp. 22-24. http://geodesic.mathdoc.fr/item/DAN_1993_328_1_a4/