Follow Slashdot stories on Twitter

 



Forgot your password?
typodupeerror
Math

Submission + - Traveling Salesman in Polynomial Time? (blogspot.com) 2

James writes: Kingrames, a regular Slashdotter, has recently posted his second of two solutions to the Traveling Salesman problem, both of which are done in Polynomial time. He's asking for fellow mathematicians and computer scientists to lend a hand in proving and disproving his theories, and welcomes all feedback. If this discovery turns out to be true, it calls into question the idea that there are no polynomial-time solutions to these "hard" problems, and that would be very significant. If you have the time, and the inclination, please consider lending your helping hand.

Slashdot Top Deals

There is very little future in being right when your boss is wrong.

Working...