Become a fan of Slashdot on Facebook

 



Forgot your password?
typodupeerror
Get HideMyAss! VPN, PC Mag's Top 10 VPNs of 2016 for 55% off for a Limited Time ×
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.

Slashdot Top Deals

Real Users are afraid they'll break the machine -- but they're never afraid to break your face.

Working...