RUS  ENG
Full version
JOURNALS // Mathematical Education // Archive
Math. Ed., 2009 Issue 3(51), Pages 27–38 (Mi mo120)
Students and teachers of mathematical specialties

Complexity of Problem Solving

A. Lyakhov


Abstract: 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.


© Steklov Math. Inst. of RAS, 2024