Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/17/84; site milford.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!gamma!epsilon!zeta!sabre!petrus!bellcore!decvax!ittatc!milford!bill
From: bill@milford.UUCP (bill)
Newsgroups: net.math
Subject: Re: P = NP Article
Message-ID: <126@milford.UUCP>
Date: Thu, 27-Mar-86 13:23:46 EST
Article-I.D.: milford.126
Posted: Thu Mar 27 13:23:46 1986
Date-Received: Sat, 29-Mar-86 05:44:47 EST
References: <729@uwvax.UUCP>
Organization: Telecomp,Inc. , Milford Ct.
Lines: 18

> 
> 	E.R. Swart has indeed claimed to have shown that P = NP. The result

> triply subscripted variables is presented and by relaxing the
                                                ^^^^^^^^^^^^^^^
> zero/one restrictions and adding additional linear constraints
  ^^^^^^^^^^^^^^^^^^^^^
> together with additionl variables, with up to as many as 8 
> subscripts, this formulation is converted into a linear
> programming formulation.  In the light of results of 

Hmmm. Isn't he simply 'solving' an ILP problem by relaxing the restriction
that the solution be INTEGER vectors?  Its well known that LP problems 
have polynomial solutions.  The problem is that the optimal solution with
only integer (or 0/1) coordinates is still hard to find even when
one finds the optimal over the reals.

Of course there might be more hidden in that "additional linear constraints"