Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!


Forgot your password?
Check out the new SourceForge HTML5 internet speed test! No Flash necessary and runs on all devices. ×

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

The end of labor is to gain leisure.