NP-complete and NP-Hard?

From: yijun_lily@xxxxxxxxx
Date: 19 Jun 2005 18:54:53 -0700

Dear all,

I don't quite understand NP-Complete and NP-Hard problem, eventhough I
read some books about algorithm. Can anybody tell me about them?

Is NP-complete and NP-Hard problem a problem that can't be solved in
polynomial time (i.e.)?

Thanks,

.

Follow-Ups:
- Re: NP-complete and NP-Hard?
  - From: Torben Ægidius Mogensen
- Re: NP-complete and NP-Hard?
  - From: Keith Ramsay
- Re: NP-complete and NP-Hard?
  - From: Torkel Franzen

Prev by Date: Re: ZFC
Next by Date: Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
Previous by thread: help with problems on computability needed!!
Next by thread: Re: NP-complete and NP-Hard?
Index(es):
- Date
- Thread

Relevant Pages

Re: NP-complete and NP-Hard?
... > I don't quite understand NP-Complete and NP-Hard problem, ... NP is the class of problems that can be solved in polynomial time (in ... that you need exponential time to solve an NP problem - there might be ...
(comp.theory)
Re: NP-complete and NP-Hard?
... |I don't quite understand NP-Complete and NP-Hard problem, eventhough I ... |read some books about algorithm. ...
(comp.theory)