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."

22 of 232 comments (clear)

  1. Better solution... by Anonymous Coward · · Score: 5, Funny

    I think a couple of gaurd dogs and a shotgun are a good enough method to solve the travelling salesman problem.

    1. Re:Better solution... by spun · · Score: 2, Funny

      You don't even need to go that far. In fact, if you don't have an attractive teenage daughter you should be all right. If you do, you simply do not let the traveling salesman sleep anywhere on your property. Or so I've heard.

      --
      - None can love freedom heartily, but good men; the rest love not freedom, but license. -- John Milton
    2. Re:Better solution... by AndersOSU · · Score: 2, Funny

      If you have a hot daughter odds are you already had a traveling salesman problem, you just didn't know about it.

  2. I for one by Mipoti+Gusundar · · Score: 0, Funny

    I for one am welcomming our new briefcase carrying shiny shoes foot in the door encylopadea selling in most efficient manners overloads!

    --
    Will code for new sig.
  3. Article is also NP-Complete Problem by LiquidCoooled · · Score: 4, Funny

    In order that you can solve the article and produce feasible text in quadratic time you have to use a novel technique of installing a PDF reader.

    --
    liqbase :: faster than paper
  4. Obligatory by Tackhead · · Score: 4, Funny
    "Nothing to see here. Please move along, but no, no, no, not over that bridge, you idiot! That's another one of those fucking pathological edge cases that invalidates what would have been an otherwise great TSP equivalence proof, and now I have to start all over again! Curse you, Konigsberg, why didn't the Brits and the Russians and the Germans finish you off when you were fair game!"

    (Did I mention how much I hated my Computability and Complexity courses when I was in college?)

  5. So (a real comment)... by LiquidCoooled · · Score: 5, Funny

    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 :: faster than paper
    1. Re:So (a real comment)... by LiquidCoooled · · Score: 2, Funny

      You just don't get it...
      The travelling fibre layer must visit every city from every other city making his journey MUCH longer than the original salesman.
      Might be easier just giving the fibre fitter a second moonlighting job as a salesman.

      --
      liqbase :: faster than paper
  6. First Thoughts by TheRequiem13 · · Score: 5, Funny

    ...gedankenexperiment...
    Gasundheit!
    --
    What?
  7. GRB explanation by a.d.venturer · · Score: 4, Funny

    As pointed out here "Apparently the method is polynomial in time, but exponential in energy ..."

    to which Charles Stross replies "Ah, so that's what the short duration GRBs are!"

    Fnord.

  8. Re:Some Reference info by ZOMFF · · Score: 5, Funny
    --
    Launch every sig.
  9. You've exceeded Slashdot's DMR by spun · · Score: 3, Funny

    That joke has too high of a Dennis Miller ratio even for Slashdot.

    --
    - None can love freedom heartily, but good men; the rest love not freedom, but license. -- John Milton
  10. P= NP by naoursla · · Score: 2, Funny

    P is equal to NP because processing speed is increasing expoentially. Each year, the amount of processing you can do doubles.

    The researchers are just using an expoential number of photons to aid in the processing.

  11. Josie Bauer addressed Travelling Salesman problem by karlandtanya · · Score: 3, Funny
    Some time ago.


    Solution involved a Farmer's daughter, which she apparently was.

    --
    "Reality is that which, when you stop believing in it, it doesn't go away." - Philip K. Dick
  12. Re:exponential photons == not practical by RealAlaskan · · Score: 4, Funny
    ... their algorithm would require on the order of 50^50 photons (about 10^85). For comparison, the Sun emits roughly 10^45 photons per second.

    So, are you saying that this is a pretty bright idea? Or that it's not so bright?

  13. Mad moderation. by serviscope_minor · · Score: 2, Funny

    The parent post is woefully incorrect (just read a wikipedia article on NP completeness). But it is not a troll.

    Please, mods use some sense in moderating.

    --
    SJW n. One who posts facts.
  14. Re:Not the first time this has been proposed by Climate+Shill · · Score: 2, Funny

    Or to put it a little more excitingly, solving a 26 step problem with 12um photons will take somewhere in the region of 25 megatons.

    Which means you would probably have to be pretty desperate for sales.

  15. Re:The run time is wrong by SamP2 · · Score: 3, Funny

    >I would say they're still looking at an n^n problem unless they can produce an infinite number of photons instantly, and that would damage the equipment

    If you can produce an infinite number of photons instantly than I don't think you'd be worried about any kind of equipment.

    For starters, try producing an infinite number of photons non-instantly (in a finite period of time), OR try to produce a finite number of photons instantly. Equipment will be the least of your problems.

  16. Re:Parallel computing by camperdave · · Score: 4, Funny

    ...and Heisenberg says you never will.

    He may have said it, but he wasn't certain about it.

    --
    When our name is on the back of your car, we're behind you all the way!
  17. More precisely, wouldn't you be a German Nazi? by JimTheta · · Score: 3, Funny

    Your friendly neighbourbood grammar Nazi

    If I had a hard-ass Spanish teacher correcting my Spanish, then I'd call him/her a "Spanish Nazi". So, you know, if you were correcting my German, it stands to follow...

    I'm just sayin'.

  18. Congratulations by Anonymous Coward · · Score: 1, Funny
    You have discovered an O(n^2) way to determine the shortest path between two cities.

    ...Although I suspect there may be a slightly faster algorithm.

  19. Re:Parallel computing by camperdave · · Score: 2, Funny

    Schrödinger's cat wasn't going to commit to one side or the other until he saw it in action.

    --
    When our name is on the back of your car, we're behind you all the way!