Y
Hacker News
new
|
ask
|
show
|
jobs
by
gugagore
3041 days 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"