Re: NP-complete and NP-Hard?

Bart Demoen <bmd@xxxxxxxxxxxxxxxxx> writes:

> Torben Ægidius Mogensen wrote:
>
> > So NP-complete \subseteq NP \subseteq NP-hard.

Is this true? I though that NP-complete is the intersection of
NP and NP-hard.

> Also "NP-complete is strict subset of NP" - right ?

Isn't this question equivalent to P ?= NP ?

A+

--
Jean-Marc
.

Relevant Pages

  • Re: NP-hardness
    ... completeness proof (reduction from a known NP-complete decision problem ... NP-hard problem to it) and that it is NP. ... Optimization problem which is NP hard but not NP-complete like minimum ... We'll solve SAT by finding the minimum reprezentation of BF. ...
    (sci.math)
  • Re: Can someone give me an example of this type of problem?
    ... > I have seen the definition of NP-Complete as a problem that is both NP-Hard ... > and in NP and began wondering about problems that didn't fit this definition. ... is apparently harder than any NP-complete problem. ...
    (comp.theory)
  • Re: NP - Hard -- Approximation algos
    ... A NP-hard problem is a problem such that every problem in NP poly-time ... (NP-complete). ... route shorter than k for this graph!", ...
    (sci.crypt)
  • Re: NP-complete and NP-Hard?
    ... There are NP-hard problems that are not in NP, ... Yes, NP-complete ... the trivial languages. ...
    (comp.theory)