|
Prev: M`I,5.Pers ecution - B BC News casters Li e & Den y They re W atching Me
Next: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
From: A.L. on 26 Dec 2007 08:53 On Tue, 25 Dec 2007 19:40:39 -0800 (PST), Zhu Guohun <ccghzhu(a)hrt.dis.titech.ac.jp> wrote: >Determining a Hamiltonian cycle in 2-connected bipartite cubic graph >had been claimed as a NP-completed problem by Akiyama etc. Now we >show that this problem is in polynomial, thus this is the second >case for P =NP which checked not only by testing but also by pure >mathematics (the detail will show latter). The first case could >reference here arXiv:0704.0309v3( http://arxiv.org/abs/0704.0309v3) >The coding and the basic idea are shown in http://www.glrq.net/bicubic.html. >Any comments is welcome! > >------------------------------------ > Guohun Zhu Theorem 7 is short. It states that P=NP. This means that paper is ABSULUTELY REVOLUTIONARY and everybody should read it. With attantion it deserves... A.L.
From: Fra on 26 Dec 2007 15:56 > Theorem 7 is short. It states that P=NP. This means that paper is > ABSULUTELY REVOLUTIONARY and everybody should read it. With attantion > it deserves... > > A.L. The paper was not published by a peer-reviewed journal this means that it has not been verified by experts in the area. In arxiv archive there are a lot of publication that states "P=NP" look here: http://www.win.tue.nl/~gwoegi/P-versus-NP.htm
From: A.L. on 26 Dec 2007 16:27
On Wed, 26 Dec 2007 20:56:12 GMT, "Fra" <fra.cristiano(a)gmail.com> wrote: >> Theorem 7 is short. It states that P=NP. This means that paper is >> ABSULUTELY REVOLUTIONARY and everybody should read it. With attantion >> it deserves... >> >> A.L. > >The paper was not published by a peer-reviewed journal this means that it >has not been verified by experts in the area. >In arxiv archive there are a lot of publication that states "P=NP" look >here: >http://www.win.tue.nl/~gwoegi/P-versus-NP.htm > > Well... I wrote, quote " with attention it deserves..." A.L. |