Re: NP-complete and NP-Hard?
- From: Bart Demoen <bmd@xxxxxxxxxxxxxxxxx>
- Date: Tue, 21 Jun 2005 16:10:30 +0200
Torben Ægidius Mogensen wrote:
So NP-complete \subseteq NP \subseteq NP-hard.
Also "NP-complete is strict subset of NP" - right ?
Bart Demoen .
- Follow-Ups:
- Re: NP-complete and NP-Hard?
- From: Bryan Olson
- Re: NP-complete and NP-Hard?
- From: Jean-Marc Bourguet
- 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
- NP-complete and NP-Hard?
- Prev by Date: Re: NP-complete and NP-Hard?
- 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):
