3 ms·
Just to be clear, NP hardness is a property of a problem class, not an algorithm. Similarly, "NP Hard" isn't the same as "worst case exponential time"
by gugagore 9y ago
Just to be clear, NP hardness is a property of a problem class, not an algorithm. Similarly, "NP Hard" isn't the same as "worst case exponential time"