[1] Balakrishnabati, P. Private communication with Honey Danber.
--
Parturiunt montes, nascetur ridiculus mus!
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.
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: j...@wucs.UUCP or ..!{ihnp4,seismo}!wucs!jst
ARPANET: wucs!j...@seismo.ARPA
CSNET: wucs!j...@seismo.ARPA%csnet-relay