![P vs. NP and the Computational Complexity Zoo](https://hight3ch.com/wp-content/uploads/2016/05/p-vs-np-and-the-computational-co.jpg)
The P versus NP problem is a major unsolved problem in computer science. Informally speaking, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.
The P versus NP problem is a major unsolved problem in computer science. Informally speaking, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.