|
Mathematical Education, 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.
Citation:
A. Lyakhov, “Complexity of Problem Solving”, Math. Ed., 2009, no. 3(51), 27–38
Linking options:
https://www.mathnet.ru/eng/mo120 https://www.mathnet.ru/eng/mo/y2009/i3/p27
|
Statistics & downloads: |
Abstract page: | 141 | Full-text PDF : | 272 |
|