IETF Logo Mail Archive

Re: [rrg] p=np !

Tony Li <tony.li@tony.li> Wed, 07 September 2011 15:03 UTC

Return-Path: <tony.li@tony.li>
X-Original-To: rrg@ietfa.amsl.com
Delivered-To: rrg@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 20D1221F8A56 for <rrg@ietfa.amsl.com>; Wed, 7 Sep 2011 08:03:03 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -102.199
X-Spam-Level:
X-Spam-Status: No, score=-102.199 tagged_above=-999 required=5 tests=[AWL=-0.200, BAYES_00=-2.599, J_CHICKENPOX_12=0.6, USER_IN_WHITELIST=-100]
Received: from mail.ietf.org ([12.22.58.30]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id Muo8s76hsVtN for <rrg@ietfa.amsl.com>; Wed, 7 Sep 2011 08:02:59 -0700 (PDT)
Received: from qmta12.westchester.pa.mail.comcast.net (qmta12.westchester.pa.mail.comcast.net [76.96.59.227]) by ietfa.amsl.com (Postfix) with ESMTP id 2CD0D21F86DF for <rrg@irtf.org>; Wed, 7 Sep 2011 08:02:59 -0700 (PDT)
Received: from omta12.westchester.pa.mail.comcast.net ([76.96.62.44]) by qmta12.westchester.pa.mail.comcast.net with comcast id VquN1h0040xGWP85Cr4oBM; Wed, 07 Sep 2011 15:04:48 +0000
Received: from sjc-vpn2-428.cisco.com ([128.107.239.233]) by omta12.westchester.pa.mail.comcast.net with comcast id Vr4Y1h01F52qHCY3Yr4bVH; Wed, 07 Sep 2011 15:04:46 +0000
Mime-Version: 1.0 (Apple Message framework v1084)
Content-Type: text/plain; charset="iso-8859-1"
From: Tony Li <tony.li@tony.li>
In-Reply-To: <8CE3B51EFAE4F02-2338-2D26D@webmail-d079.sysops.aol.com>
Date: Wed, 07 Sep 2011 08:04:31 -0700
Content-Transfer-Encoding: quoted-printable
Message-Id: <78CB3806-B5AB-44DF-AF0B-0F8C069D93EA@tony.li>
References: <4E653839.3000001@wmich.edu> <8CE3B51EFAE4F02-2338-2D26D@webmail-d079.sysops.aol.com>
To: HeinerHummel@aol.com
X-Mailer: Apple Mail (2.1084)
Cc: rrg@irtf.org
Subject: Re: [rrg] p=np !
X-BeenThere: rrg@irtf.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: IRTF Routing Research Group <rrg.irtf.org>
List-Unsubscribe: <http://www.irtf.org/mailman/options/rrg>, <mailto:rrg-request@irtf.org?subject=unsubscribe>
List-Archive: <http://www.irtf.org/mail-archive/web/rrg>
List-Post: <mailto:rrg@irtf.org>
List-Help: <mailto:rrg-request@irtf.org?subject=help>
List-Subscribe: <http://www.irtf.org/mailman/listinfo/rrg>, <mailto:rrg-request@irtf.org?subject=subscribe>
X-List-Received-Date: Wed, 07 Sep 2011 15:03:03 -0000

Gentlebeings,

This conversation is not productive.  Please cease and desist.

Tony


On Sep 7, 2011, at 1:47 AM, HeinerHummel@aol.com wrote:

> I am no scientist, but may be you are ?:
> 
> I wonder why the Traveling Salesman Problem is said to be NP-hard although 
> it can be solved by Linear Programming ?
> 
> I appreciate any clarifying info.
> 
> Heiner
> 
> 
> 
> 
> 
> -----Ursprüngliche Mitteilung----- 
> Von: Leszek T. Lilien <leszek.lilien@wmich.edu>
> An: rrg <rrg@irtf.org>
> Verschickt: Mo, 5 Sept 2011 6:59 pm
> Betreff: Re: [rrg] p=np !
> 
> Heiner,
> 
> Are you a scientist or not?
> 
> Your message suggests the latter. (A scientist would vive a proper 
> reference!)
> 
>     Leszek
> 
> 
> 
> -------- Original Message --------
> Subject: 	Re: [rrg] p=np !
> Date: 	Mon, 05 Sep 2011 16:39:23 -0400 (EDT)
> From: 	
> heinerhummel@aol.com
> 
> To: 	
> jinchoe@gmail.com
> 
> CC: 	
> rrg@irtf.org
> 
> 
> 
> 
> Sorry, I can't.
> It is only myself who thinks to have developed a solution for a np-hard
> problem. Precisely for the Steiner Tree problem.
> A solution by which any possible lever is applied to improve a current
> Steiner Tree until no further lever can quench out any more weight
> reduction of the tree at all.
> 
> I am not a man the press is interested in. Hence I cannot refer to any
> press news.
> 
> Heiner
> 
> 
> 
> -----Ursprüngliche Mitteilung-----
> Von: JinHyeock Choi <
> jinchoe@gmail.com
> >
> An: heinerhummel <
> heinerhummel@aol.com
> >
> Cc: rrg <
> rrg@irtf.org
> >
> Verschickt: So, 4 Sept 2011 8:17 pm
> Betreff: Re: [rrg] p=np !
> 
> >  I like to assure all on this mailing list that P = NP.
> 
> You mean
> it has been proved that P = NP?
> 
> if so, would you provide a pointer to a relevant article?
> 
> That could bring forth a huge impact.
> 
> best regards
> 
> JinHyeock
> 
> _______________________________________________
> rrg mailing list
> 
> rrg@irtf.org
> http://www.irtf.org/mailman/listinfo/rrg
> 
> 
> 
> _______________________________________________
> rrg mailing list
> rrg@irtf.org
> http://www.irtf.org/mailman/listinfo/rrg

v2.23.0 | Report a Bug | By Email