Re: computer-go: NP-complete problems solved?

[Daniel Bump <bump@xxxxxxxxxxxxxxxxxx>]

Serge Boisse wrote:

> Yes, it might be possible that P=NP. wether Plotnikov's work is a proof of
> it, wait and see... For myself, I will check that in depth only when he is
> published in a referee journal.

A.D. Plotnikov has 8 papers published in refereed journals, including the
relevant one:

Plotnikov, Anatoly D. Polynomial-time partition of a graph into
cliques. Southwest J. Pure Appl. Math. 1996, no. 1, July 1996, 16--29.

Lots of wrong papers have been published in refereed journals,
and on the other hand, right papers (such as Apery's proof that
zeta(3) is irrational and de Branges proof of the Bieberbach
conjecture) have been rejected as incorrect.

Daniel Bump