Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!ernie.Berkeley.EDU!jwl
From: jwl@ernie.Berkeley.EDU (James Wilbur Lewis)
Newsgroups: comp.ai.neural-nets
Subject: Re: implementation of "traveling salesman algorithm" on connection machine
Keywords: TSP, connection machine
Message-ID: <27893@ucbvax.BERKELEY.EDU>
Date: 4 Feb 89 10:09:43 GMT
References: <1637@cps3xx.UUCP> <49632@yale-celray.yale.UUCP>
Sender: usenet@ucbvax.BERKELEY.EDU
Reply-To: jwl@ernie.Berkeley.EDU.UUCP (James Wilbur Lewis)
Distribution: usa
Organization: University of California, Berkeley
Lines: 16

In article <49632@yale-celray.yale.UUCP> berryman-harry@CS.YALE.EDU (Harry Berryman) writes:
-In article <1637@cps3xx.UUCP> artzi@cpsvax.cps.msu.edu (Ytshak Artzi - CPS) writes:
->
->   Does anyone know about any implementation of efficient
->algorithms for the Traveling salesman Problem (TSP) on the
->Connection Machine ?
-
-Anyone who answers that question "Yes" is not telling the truth. The
-TSP is known to take at least exponential time, CM or no CM. 
                      ^^^^^^^^^^^^^^^^^^^^

Excuse me?!! Has someone proven P <> NP and I just haven't heard about
it yet?

-- Jim Lewis
   U.C. Berkeley