Most researchers believe that P and NP are not the same class
The class P consists of problems that can be solved quickly
The class NP consists of problems for which a solution can be verified quickly
If any NP-complete problem can be solved in polynomial time, then every problem in NP has a polynomial-time solution, that is, P = NP.