P vs NP Problem

computation

Definition

P vs NP Problem

The P vs NP problem asks whether every decision problem in NP is also in P. Equivalently, it asks whether

$$\mathrm{P}=\mathrm{NP}.$$

If the equality holds, then every problem whose solutions can be verified in polynomial time can also be solved in polynomial time.