Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site watdaisy.UUCP
Path: utzoo!watmath!watnot!watdaisy!ghgonnet
From: ghgonnet@watdaisy.UUCP (Gaston H Gonnet)
Newsgroups: net.math,net.research
Subject: Re: Need article on P=NP
Message-ID: <7682@watdaisy.UUCP>
Date: Wed, 26-Mar-86 15:56:58 EST
Article-I.D.: watdaisy.7682
Posted: Wed Mar 26 15:56:58 1986
Date-Received: Thu, 27-Mar-86 01:30:02 EST
References: <4626BSD@PSUVM> <674@down.FUN>
Organization: U of Waterloo, Ontario
Lines: 17
Xref: watmath net.math:3002 net.research:440

Transcribed without comment (I have the technical report).

Title:   P = NP by E.R. Swart, Department of Computing and Information
Science, University of Guelph, Research Report CIS86-02, February 1986.

Abstract:
A mathematical progamming formulation of the Hamilton circuit problem
involving zero/one restrictions and triply subscripted variables is
presented and by relaxing the zero/one restrictions and adding additional
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 Karmakar concerning the existence of polynomial time algorithms
for linear programming this establishes the fact that the Hamilton
circuit problem can be solved in polynomial time.  Since the Hamilton
circuit problem belongs to the set of NP-complete problems it follows
that P = NP.