Geodesic
On estimating the complexity and approximate decoding of combinatorial descriptions
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 2 (1980), pp. 70-72 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_1980_2_a9,
     author = {S. V. Ovchinnikov},
     title = {On estimating the complexity and approximate decoding of combinatorial descriptions},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {70--72},
     year = {1980},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1980_2_a9/}
}
TY  - JOUR
AU  - S. V. Ovchinnikov
TI  - On estimating the complexity and approximate decoding of combinatorial descriptions
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1980
SP  - 70
EP  - 72
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/IVM_1980_2_a9/
LA  - ru
ID  - IVM_1980_2_a9
ER  - 
%0 Journal Article
%A S. V. Ovchinnikov
%T On estimating the complexity and approximate decoding of combinatorial descriptions
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1980
%P 70-72
%N 2
%U http://geodesic.mathdoc.fr/item/IVM_1980_2_a9/
%G ru
%F IVM_1980_2_a9
S. V. Ovchinnikov. On estimating the complexity and approximate decoding of combinatorial descriptions. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 2 (1980), pp. 70-72. http://geodesic.mathdoc.fr/item/IVM_1980_2_a9/