3 ms·
From the Definition section >A decision problem H is NP-hard when for every problem L in NP, there is a polynomial-time many-one reduction from L to H
by alex_smart 2y ago
From the Definition section
>A decision problem H is NP-hard when for every problem L in NP, there is a polynomial-time many-one reduction from L to H
- Maxatar 2y agoYes that is correct for decision problems.