Re: NP-complete and NP-Hard?
- From: Bryan Olson <fakeaddress@xxxxxxxxxxx>
- Date: Tue, 21 Jun 2005 19:51:23 GMT
Bart Demoen wrote: > Also "NP-complete is strict subset of NP" - right ?
Right.
-- --Bryan .
- Follow-Ups:
- Re: NP-complete and NP-Hard?
- From: Shashi
- 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
- NP-complete and NP-Hard?
- Prev by Date: Re: NP-complete and NP-Hard?
- Next by Date: Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
- Previous by thread: Re: NP-complete and NP-Hard?
- Next by thread: Re: NP-complete and NP-Hard?
- Index(es):
