NP (complexity)
= NP
{disambiguate=complexity}
{c}
{title2=$\mathbf{NP}$}
{wiki}
$\mathbf{NP}$ is the class of <decision problem>[decision problems] whose positive instances have polynomial-length <certificate in computational complexity>[certificates] verifiable in <polynomial time>. Equivalently, it is polynomial time on a <nondeterministic computation>.
= NP
{synonym}