The P [P (Complexity)] versus NP [NP (Complexity)] problem is a major unsolved problem in theoretical computer science. In informal terms, it asks whether every problem whose solution can be quickly verified [NP] can also be quickly solved [P].

(“P versus NP Problem” 2023)