Re: JSH: They lie
- From: sg552@xxxxxxxxxxxxx
- Date: 6 Mar 2007 05:49:14 -0800
James Harris wrote:
Those of you who more than pretend to care about your field should do
the fact checking. Like check on Plotnikov's research.
I have gone one better: I emailed Professor Plotnikov to ask about his
research, and he very kindly replied. This is what he wrote:
***Begin Quote***
Hi,
You wrote:
Hi. Sorry to contact you out of the blue, but in a discussion onusenet a poster has brought up the subject of your paper "Polynomial-
Time Partition of a Graph into Cliques" from the July 1996 issue of
SWJPAM, which may show that P=NP. On a previous occasion when this
subject was brought up another poster claimed that you later agreed
that the paper was incorrect. I wonder whether you can confirm this?
Alas, it was found that the algorithm has cycling on some instances.
However, I have a new
polynomial-time algorithm for finding the maximum independent set in
an undirected graph. The corresponding program shown correctness of
this algorithm. Unfortunately, the algorithm uses
a hypothesis.
Anatoly Plotnikov
Professor, PhD
***End Quote***
In light of this, James, you should probably stop citing Plotnikov's
paper as evidence in your favour. Either that, or you could just start
calling him a liar ;-)
-Rotwang
.
- Follow-Ups:
- Re: JSH: They lie
- From: jstevh
- Re: JSH: They lie
- References:
- JSH: They lie
- From: jstevh
- JSH: They lie
- Prev by Date: Re: JSH: Good news!
- Next by Date: Re: Quantum Cryptography can not work
- Previous by thread: Re: They lie
- Next by thread: Re: JSH: They lie
- Index(es):
Relevant Pages
|