Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!ihnp4!ltuxa!we53!wucs!jst
From: jst@wucs.UUCP
Newsgroups: net.wanted,net.sci,net.math,net.research
Subject: Re: Need article on P=NP
Message-ID: <1514@wucs.UUCP>
Date: Thu, 27-Mar-86 17:34:52 EST
Article-I.D.: wucs.1514
Posted: Thu Mar 27 17:34:52 1986
Date-Received: Sun, 30-Mar-86 02:38:05 EST
References: <4626BSD@PSUVM>
Reply-To: jst@wucs.UUCP (Jon Turner)
Organization: Washington U. in St. Louis
Lines: 18
Xref: watmath net.wanted:8505 net.sci:661 net.math:3016 net.research:444

In article <4626BSD@PSUVM> BSD@PSUVM.BITNET writes:
>I'm looking for an article that was posted about 3 weeks or so
>ago about some research being done by Ted Swart at the
>University of Guelph.  The article is about a linear programming
>formulation of the Hamiltonian circuit problem showing
>that P=NP.
>     

Is this for real? It's still a few days early for April Fools day.
If anyone has any definite information on this, please forward it
to me.

-- 

Jon Turner 	Washington University in St. Louis 314-889-6193
UUCP:		jst@wucs.UUCP  or  ..!{ihnp4,seismo}!wucs!jst
ARPANET:	wucs!jst@seismo.ARPA
CSNET:		wucs!jst@seismo.ARPA%csnet-relay