Geodesic
The problem of lower bounds of complexity and the theory of NP-completeness (survey)
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 5 (1981), pp. 17-25 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_1981_5_a2,
     author = {R. G. Nigmatullin},
     title = {The problem of lower bounds of complexity and the theory of {NP-completeness} (survey)},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {17--25},
     year = {1981},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1981_5_a2/}
}
TY  - JOUR
AU  - R. G. Nigmatullin
TI  - The problem of lower bounds of complexity and the theory of NP-completeness (survey)
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1981
SP  - 17
EP  - 25
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/IVM_1981_5_a2/
LA  - ru
ID  - IVM_1981_5_a2
ER  - 
%0 Journal Article
%A R. G. Nigmatullin
%T The problem of lower bounds of complexity and the theory of NP-completeness (survey)
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1981
%P 17-25
%N 5
%U http://geodesic.mathdoc.fr/item/IVM_1981_5_a2/
%G ru
%F IVM_1981_5_a2
R. G. Nigmatullin. The problem of lower bounds of complexity and the theory of NP-completeness (survey). Izvestiâ vysših učebnyh zavedenij. Matematika, no. 5 (1981), pp. 17-25. http://geodesic.mathdoc.fr/item/IVM_1981_5_a2/