Source: cirosantilli/p-versus-np-problem
= P versus NP problem
{wiki}
= P vs NP
{c}
{synonym}
{title2}
Interesting because of the <Cook-Levin theorem>: if only a single <NP-complete> problem were in <P (complexity)>, then all NP-complete problems would also be P!
We all know the answer for this: either false or <independent (mathematical logic)>.