3 ms·Nitpicking: In general, an NP problem can be reduced to an NP-hard problem (in poly-time).by a-nikolaev 13y agoNitpicking: In general, an NP problem can be reduced to an NP-hard problem (in poly-time).