``Easy” and ``Difficult” Problems
摘要
We discuss the classes of polynomial and exponential time algorithms starting from the problems of finding an Eulerian cycle and a Hamiltonian cycle in a graph. This leads to the famous P versus NP unsolved problem explained in plane terms and to the definition of NP-complete problems as the ``most difficult” in the class NP.