Slashdot Mirror
Optical Solution For an NP-Complete Problem?
6 writes to let us know that two optical researchers have proposed, as a thought experiment, a novel idea for solving the traveling salesman problem. From the abstract: 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."
I think a couple of gaurd dogs and a shotgun are a good enough method to solve the travelling salesman problem.
So, to find out the shortest path for a travelling salesman you have to have a travelling Fibre fitter installing cables between all the cities?
What is the optimum path the fibre fitter must take to lay all the cables and reduce his mileage?
liqbase
...gedankenexperiment...Gasundheit!
What?
Badonkadonkexperiment ???
Launch every sig.