Tony!

Are you sure you have the right to muzzle others?  I just wonder...

BTW, this non-productive discussion started long time ago. I tried to push it on a sounder ground asking for references.

I am sorry to say that I gather from Heiner's answer that he has not much of a clue about the topic he started...

Best regards,

   Leszek

-------- Original Message --------
Subject: Re: [rrg] p=np !
Date: Wed, 07 Sep 2011 08:04:31 -0700
From: Tony Li <tony...@tony.li>
To: heinerhum...@aol.com
CC: leszek.lil...@wmich.edu, rrg@irtf.org



Gentlebeings,

This conversation is not productive.  Please cease and desist.

Tony


On Sep 7, 2011, at 1:47 AM, heinerhum...@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.lil...@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:   
heinerhum...@aol.com

To:     
jinc...@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 <
jinc...@gmail.com
>
An: heinerhummel <
heinerhum...@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

_______________________________________________
rrg mailing list
rrg@irtf.org
http://www.irtf.org/mailman/listinfo/rrg

Reply via email to