Geodesic
Complexity of Problem Solving
Matematičeskoe obrazovanie, Tome 51 (2009) no. 3, pp. 27-38.

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

The complexity of types P and NP of problem solving is discussed. The (probabilistic) algorithm of one famous computer game is analyzed from this point of view. 
@article{MO_2009_51_3_a3,
     author = {A. Lyakhov},
     title = {Complexity of {Problem} {Solving}},
     journal = {Matemati\v{c}eskoe obrazovanie},
     pages = {27--38},
     publisher = {mathdoc},
     volume = {51},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MO_2009_51_3_a3/}
}
TY  - JOUR
AU  - A. Lyakhov
TI  - Complexity of Problem Solving
JO  - Matematičeskoe obrazovanie
PY  - 2009
SP  - 27
EP  - 38
VL  - 51
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MO_2009_51_3_a3/
LA  - ru
ID  - MO_2009_51_3_a3
ER  - 
%0 Journal Article
%A A. Lyakhov
%T Complexity of Problem Solving
%J Matematičeskoe obrazovanie
%D 2009
%P 27-38
%V 51
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MO_2009_51_3_a3/
%G ru
%F MO_2009_51_3_a3
A. Lyakhov. Complexity of Problem Solving. Matematičeskoe obrazovanie, Tome 51 (2009) no. 3, pp. 27-38. http://geodesic.mathdoc.fr/item/MO_2009_51_3_a3/