Approximate Algorithms for NP-Hard (Complete) Problems: A Reference

Have you ever wondered if a specific NP-hard problem has an approximation algorithm or not? If yes, you may like to visit this site: A Compendium of NP optimization problems.

This entry was posted in Theoretical Computer Science. Bookmark the permalink.

One Response to Approximate Algorithms for NP-Hard (Complete) Problems: A Reference

  1. Marcelo says:

    Hi, Amir!

    Man, you should take a look at this paper here:

    Quantum Computation vs. Evolutionary Computation : Could Evolutionary Computation Become Obsolete?

    http://www.iss.whu.edu.cn/degaris/papers/CEC-QNN-2003.PDF

    The paper title sounds a “little” sensationalist.

    Até Mais!

    Marcelo

Leave a Reply

Your email address will not be published. Required fields are marked *