http://qs321.pair.com?node_id=1068071


in reply to Re: Travelling problem
in thread Travelling problem

Fast (i.e. non-polynomial) computation
You mean "i.e. polynomial," right? NP is exponential ;-). I heartily agree with your post, and defer to my favorite MJD talk for the details.

EDIT: Nut graph:

next time someone tells you to give up on your problem because it's NP-complete, ignore them.