P vs NP

Read here the entire article on DDJ.com: http://www.ddj.com/architect/221600058

I love this remark:
“NP-completeness “tells you something very specific:It tells you that if you’re going to look for an algorithm that’s going to work in every case and give you the best solution, you’re doomed: don’t even try. That’s useful information.”

~ by msorin on November 4, 2009.

Leave a Reply

You must be logged in to post a comment.