Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities
Doklady Akademii Nauk, Tome 255 (1980) no. 2, pp. 296-300
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DAN_1980_255_2_a8,
author = {S. P. Tarasov and L. G. Khachiyan},
title = {Bounds of solutions and algorithmic complexity of systems of convex {Diophantine} inequalities},
journal = {Doklady Akademii Nauk},
pages = {296--300},
publisher = {mathdoc},
volume = {255},
number = {2},
year = {1980},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DAN_1980_255_2_a8/}
}
TY - JOUR AU - S. P. Tarasov AU - L. G. Khachiyan TI - Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities JO - Doklady Akademii Nauk PY - 1980 SP - 296 EP - 300 VL - 255 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DAN_1980_255_2_a8/ LA - ru ID - DAN_1980_255_2_a8 ER -
S. P. Tarasov; L. G. Khachiyan. Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities. Doklady Akademii Nauk, Tome 255 (1980) no. 2, pp. 296-300. http://geodesic.mathdoc.fr/item/DAN_1980_255_2_a8/