The P versus NP problem is a major unsolved question in computer science that asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. Solving this problem would have profound implications for fields such as cryptography, algorithm design, and computational complexity theory.