= NP-hard {c} {wiki=NP-hardness} A problem such that all NP problems can be reduced in polynomial time to it.
Back to article page
