News for hackers. Stuff that matters.

A comment on A Solution of the P versus NP Problem?. Parent comment

Re:A Solution of the P versus NP Problem? by dbaupp on Monday August 14, 2017 @11:51PM (#15015292)
No, some NP-hard problems are outside NP (i.e. harder than NP), while some are inside. The wikipedia article has a good explanation and a good diagram: https://en.wikipedia.org/wiki/NP-hardness
[ Parent | on HN ]
Re:A Solution of the P versus NP Problem? by sova on Tuesday August 15, 2017 @09:59AM (#15018189)
Thanks many for your kind explanation. It makes more sense now. I forgot that important detail that mapping is pretty easy as most involvements reduce to and from 3-SAT
[ Parent | on HN ]