In: Computer Science
Using a suitable Venn diagram, describe the relationship between NP, NP-Hard, and NP-Complete problems from
Using the diagram, we assume that and
are not the same set, or, in
other words, we assume that
. This is our apparently-true,
but yet-unproven assertion. Of course, another interesting aspect
of this diagram is that we’ve got some overlap between
and
. We call
when the problem belongs to
both of these sets.
Alright, so, we’ve mapped ,
,
and
to “easy”, “medium”, “hard” and
“hardest”, but how does we place a given algorithm in each
category? For that, we’ll need to get a bit more formal through the
next section.