P and NP

From: "nemo" <pallabs@xxxxxxxxx>
Date: 30 Aug 2005 10:02:15 -0700

Is there a good website where the concepts of NP completeness and NP
hardness is very lucidly explained? I saw the wikipedia definition but
I was looking for something easier for the lay man.

thanks

.

Prev by Date: Turing machine and unification
Next by Date: Re: Canadian Universities
Previous by thread: Turing machine and unification
Next by thread: Priority Queues
Index(es):
- Date
- Thread

Relevant Pages

Re: System Beep
... > Is there a recommended way to generate the standard system beep? ... Just for completeness (there seem to have been a lot of sensible suggestions ... Website: http://www.flypig.co.uk ... Prev by Date: ...
(comp.sys.acorn.programmer)
Re: P and NP
... nemo wrote: ... hardness is very lucidly explained? ... I saw the wikipedia definition but I was looking for something easier for the lay man. ...
(comp.theory)