Re: NP-complete and NP-Hard?
- From: "Shashi" <kc.shashidhar@xxxxxxxxx>
- Date: 23 Jun 2005 11:55:58 -0700
Bryan Olson wrote:
> Bart Demoen wrote:
> > Also "NP-complete is strict subset of NP" - right ?
>
> Right.
>
"NP-complete is strict subset of NP" iff P!=NP ?
.
- Follow-Ups:
- Re: NP-complete and NP-Hard?
- From: Bart Demoen
- Re: NP-complete and NP-Hard?
- References:
- NP-complete and NP-Hard?
- From: yijun_lily
- Re: NP-complete and NP-Hard?
- From: Torben Ægidius Mogensen
- Re: NP-complete and NP-Hard?
- From: Bart Demoen
- Re: NP-complete and NP-Hard?
- From: Bryan Olson
- NP-complete and NP-Hard?
- Prev by Date: Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
- Next by Date: Re: NP-complete and NP-Hard?
- Previous by thread: Re: NP-complete and NP-Hard?
- Next by thread: Re: NP-complete and NP-Hard?
- Index(es):
