Re: NP-complete and NP-Hard?


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

This is answered in the FAQ.

http://db.uwaterloo.ca/~alopez-o/comp-faq/faq.html

Keith Ramsay

.

Relevant Pages

  • NP-complete and NP-Hard?
    ... I don't quite understand NP-Complete and NP-Hard problem, ... read some books about algorithm. ...
    (comp.theory)
  • Re: Challenae question for mathematician
    ... problems relating to permutation groups. ... adjacent books. ... called "bubble sort" - it is a quadratic time algorithm, ... efficient as a sorting method - efficient sorting is O. ...
    (sci.math)
  • Re: Regularly populating the line - revised version
    ... As I posted, I did hit the books before posting this, but you do raise good ... former life I designed 3D graphics chips). ... this algorithm comes from a rather different domain having no ... > more curious habit of recording much if it in books. ...
    (sci.math.num-analysis)
  • Re: srand() troubles
    ... > books are crap is a different topic.) ... of the lack of goals and direction for this forum and this language are ... > algorithm can be expressed in any Turing-complete language. ... getting those programs running on my implementation. ...
    (comp.lang.c)
  • Re: Image Newbie Question
    ... and I'd like to be able to recover the names on the books. ... processing algorithm to try and recover the ... But it will amplify all the JPEG artefacts as well probably rendering it completely illegible. ...
    (sci.image.processing)