Answer:
P versus NP
Step-by-step explanation:
The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly. ... The class of questions for which an answer can be verified in polynomial time is called NP, which stands for "nondeterministic polynomial time"
