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

 



Forgot your password?
typodupeerror
DEAL: For $25 - Add A Second Phone Number To Your Smartphone for life! Use promo code SLASHDOT25. Also, Slashdot's Facebook page has a chat bot now. Message it for stories and more. Check out the new SourceForge HTML5 internet speed test! ×
Math

Submission + - An Optical Solution For an NP-Complete problem? (opticsexpress.org)

6 writes: Tobias Haist and Wolfgang Osten have proposed a novel idea for solving the traveling salesman problem...

We introduce an optical method based on white light interferometry in order to solve the well-known NP-complete traveling salesman problem. To our knowledge it is the first time that a method for the reduction of non-polynomial time to quadratic time has been proposed. We will show that this achievement is limited by the number of available photons for solving the problem. It will turn out that this number of photons is proportional to NN for a traveling salesman problem with N cities and that for large numbers of cities the method in practice therefore is limited by the signal-to-noise ratio. The proposed method is meant purely as a gedankenexperiment.

This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

An Optical Solution For an NP-Complete problem?

Comments Filter:

The best book on programming for the layman is "Alice in Wonderland"; but that's because it's the best book on anything for the layman.

Working...