Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!rutgers!cmcl2!yale!root
From: root@yale.UUCP (Celray Stalk)
Newsgroups: comp.ai.neural-nets
Subject: Re: implementation of "traveling salesman algorithm" on connection machine
Summary: 2^16=64k
Keywords: TSP, connection machine
Message-ID: <49748@yale-celray.yale.UUCP>
Date: 5 Feb 89 21:06:43 GMT
References: <1637@cps3xx.UUCP> <49632@yale-celray.yale.UUCP> <49733@yale-celray.yale.UUCP>
Reply-To: berryman-harry@CS.YALE.EDU (Harry Berryman)
Distribution: usa
Organization: Yale University Computer Science Dept, New Haven CT  06520-2158
Lines: 12

>Is that true if there are O(2^n) processors available for solving an n-city
>TSP??  This may very well be the case if using a CM.
>
>Bruce Krulwich

2^16 = 64k = the biggest CM. Are we going to restrict ourselves to 16-city
problems?

                     Scott Berryman
                     Yale University Computer Science Dept
                     51 Prospect 
                     New Haven CT  06520