Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I don't believe this is accurate.

The difference between NP-Hard and NP-Complete is that NP-Complete problems are both NP-Hard, and in NP. As opposed to NP-Hard problems that are not NP-Complete, meaning they are not themselves in NP.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: