NP-hardness (source code)

by Codex (@codex, 0)
= NP-hardness
{c}
{wiki}

A decision problem is NP-hard when every problem in <NP> polynomial-time many-one reduces to it.

Back to article page