Re: NP-complete and NP-Hard?

From: "yijun_lily@xxxxxxxxx" <yijun_lily@xxxxxxxxx>
Date: 20 Jun 2005 07:53:59 -0700

Anybody can give me an example?Why is it significant to recognize a
problem is NP,NP-Complete or NP-Hard?

I can read the concepts about them, but I don't get their application
and why they are usefull.

Thanks,

.

Follow-Ups:
- Re: NP-complete and NP-Hard?
  - From: Jym
- Re: NP-complete and NP-Hard?
  - From: newstome

References:
- NP-complete and NP-Hard?
  - From: yijun_lily
- Re: NP-complete and NP-Hard?
  - From: Keith Ramsay

Prev by Date: Re: to CNF efficiently
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):
- Date
- Thread