Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!lll-crg!rutgers!clyde!watmath!watnot!watdragon!kyukawa
From: kyukawa@watdragon.UUCP (Keitaro Yukawa)
Newsgroups: comp.ai
Subject: P = NP
Message-ID: <1907@watdragon.UUCP>
Date: Fri, 28-Nov-86 16:29:45 EST
Article-I.D.: watdrago.1907
Posted: Fri Nov 28 16:29:45 1986
Date-Received: Fri, 28-Nov-86 21:51:39 EST
Distribution: comp
Organization: U of Waterloo, Ontario
Lines: 49

The following news appeared in the news group sci.math

--------------------------------------------------------------------

From hxd9622@ritcv.UUCP (Herman Darmawan) Fri Nov 28 02:41:59 1986
Newsgroups: sci.math
Subject: Re: P=NP (request for reference)
Date: 28 Nov 86 07:41:59 GMT
Reply-To: hxd9622@ritcv.UUCP (Herman Darmawan)
Organization: Rochester Institute of Technology, Rochester, NY

[]

                       P = NP
			 by
		     E. R. Swart

	 Department of Mathematics & Statistics
	         University of Guelph
	        Guelph, Ontario, Canada

	      Mathematical Series 1986-107

		    February 1986


Abstract:
	A mathematical programming formulation of the Hamiltonian
circuit problem involving zero/one restrictions and triply subscripted
variables is presented and by relaxing the zero/one restrictions and
adding linear constraints together with additional variables, with
up to as many as 8 subscripts, this formulation is converted into a
linear programming formulation.  In the light of the results of
Kachiyan and Karmarkar concerning the existence of polynomial time
algorithms for linear programming this establishes the fact that the
Hamiltonian circuit problem can be solved in polynomial time.  Since
the Hamiltonian circuit problem belongs to the set of NP-complete
problems it follows immediately that P=NP.

~40 pages.


-+-+-+-

Herman Darmawan @ Rochester Institute of Technology
UUCP     {allegra,seismo}!rochester!ritcv!hxd9622
BITNET   HND9622@RITVAXC

... fight mail hunger ... mail me now!