NP-Complete are NP-Hard, inside NP. | Hacker News

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

		stralep on Aug 9, 2010 \| parent \| context \| favorite \| on: Ask HN: If P = NP, what does it mean? NP-Complete are NP-Hard, inside NP.

stavros on Aug 9, 2010 [–]

Some NP-hard problems are NP-complete, but not all. I guess I should have said strictly NP-hard, thanks.

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