Fast (i.e. non-polynomial) computationYou 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.
In reply to Re^2: Travelling problem
by educated_foo
in thread Travelling problem
by Dirk80
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |