Library Web

What is the P versus NP problem?

The P versus NP problem is a major unsolved question in theoretical computer science asking whether every problem whose solution can be quickly verified can also be quickly solved. Class P represents problems solvable in polynomial time, while class NP represents problems where a proposed solution can be verified in polynomial time. Most computer scientists believe that P is not equal to NP, implying there are problems that are harder to compute than to verify.

What we know

Still open

Where to go next

Sources