Geodesic
Сложность вычислительных задач
Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (2000), pp. 81-114.

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

@article{MP_2000_a4,
     author = {M. N. Vyalyi},
     title = {{\CYRS}{\cyrl}{\cyro}{\cyrzh}{\cyrn}{\cyro}{\cyrs}{\cyrt}{\cyrsftsn} {\cyrv}{\cyrery}{\cyrch}{\cyri}{\cyrs}{\cyrl}{\cyri}{\cyrt}{\cyre}{\cyrl}{\cyrsftsn}{\cyrn}{\cyrery}{\cyrh} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}},
     journal = {Matematicheskoe Prosveshchenie},
     pages = {81--114},
     publisher = {mathdoc},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MP_2000_a4/}
}
TY  - JOUR
AU  - M. N. Vyalyi
TI  - Сложность вычислительных задач
JO  - Matematicheskoe Prosveshchenie
PY  - 2000
SP  - 81
EP  - 114
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MP_2000_a4/
LA  - ru
ID  - MP_2000_a4
ER  - 
%0 Journal Article
%A M. N. Vyalyi
%T Сложность вычислительных задач
%J Matematicheskoe Prosveshchenie
%D 2000
%P 81-114
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MP_2000_a4/
%G ru
%F MP_2000_a4
M. N. Vyalyi. Сложность вычислительных задач. Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (2000), pp. 81-114. http://geodesic.mathdoc.fr/item/MP_2000_a4/

[1] Kormen T. X., Leiserson Ch. E., Raivest R. L., Algoritmy: postroenie i analiz, Per. s angl. pod red. A. Shenya, MTsNMO, M., 1999

[2] Akho A., Khopkroft Dzh., Ulman Dzh., Postroenie i analiz vychislitelnykh algoritmov, Mir, M., 1979 | MR | Zbl

[3] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR

[4] Kitaev A., Shen A., Vyalyi M., Klassicheskie i kvantovye vychisleniya, MTsNMO, CheRo, M., 1999

[5] Manin Yu. I., Vychislimoe i nevychislimoe, Sovetskoe radio, M., 1980 | MR

[6] Razborov A. A., “O slozhnosti vychislenii”, Matematicheskoe Prosveschenie. Ser. 3, no. 3, MTsNMO, CheRo, M., 1999, 127–141

[7] Vereschagin N., Shen A., “Logicheskie formuly i skhemy”, Matematicheskoe Prosveschenie. Ser. 3, no. 4, MTsNMO, M., 2000, 53–80

[8] Knill E., Laflamme R., Quantum Computation and Quadratically Signed Weight Enumerators, xxx.lanl.gov/quant-ph/9909094

[9] Sipser M., Theory of computation, PWS Publ. Co, Boston, MA, 1997

[10] Smale S., “Problems for the next century”, Math. Intelligencer, 20:2 (1998), 7–15 | DOI | MR | Zbl