Mathematical Education
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Math. Ed.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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.
Document Type: Popular science or education materials
Language: Russian
Citation: A. Lyakhov, “Complexity of Problem Solving”, Math. Ed., 2009, no. 3(51), 27–38
Citation in format AMSBIB
\Bibitem{Lya09}
\by A.~Lyakhov
\paper Complexity of Problem Solving
\jour Math. Ed.
\yr 2009
\issue 3(51)
\pages 27--38
\mathnet{http://mi.mathnet.ru/mo120}
Linking options:
  • https://www.mathnet.ru/eng/mo120
  • https://www.mathnet.ru/eng/mo/y2009/i3/p27
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Mathematical Education
    Statistics & downloads:
    Abstract page:141
    Full-text PDF :272
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024