Millennium Prize Problems

The P versus NP problem deals with the classification of computational problems. It asks whether every problem for which a solution can be verified in polynomial time can also be solved in polynomial time. In other words, it investigates the relationship between problems that are easy to verify and those that are easy to solve.