Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial

On Dec 28 2007, 5:47 pm, Nicholas King <zed...@xxxxxxxxxxxxxxxx>
wrote:
Zhu Guohun wrote:
In fact, I had submitted several paper to some journal, but they
always refuse to review and rejected as some reason such as "not not
fall within the scope of the journal or meet all the criteria required
by the Journal... ".

So I think that the editor of most journals regards the P vs NP as
not important problem or others idea on my paper, I had to build up a
website and show my work to public.

The editors of journals regard it as a very important problem and
require the papers to be well written before they are published if it's
an appropriate topic for the journal.

If it's not an appropriate journal then you should submit a well written
article to one that is an appropriate journal, however if the
appropriate journals are rejecting you, it's not because they don't
think the problem is important , it's because your paper doesn't meet
their standards.

Frankly I'm not too surprised by what I've been seeing from you.
Submissions of articles proving NP=P and NP!=P both demand extraordinary
proof and are a popular topic for cranks.

Nicholas King

Thank you for your comments about P vs NP problem.
I could understand that the prestigious journal is always cautious. So
I built up this website to enhance my recently draft.
It is not very important to prove P=NP, since it is not easy to
understand by a non-computer majors, but it is important to solve the
existence NP-Complete problem by simplify mathematical formula which
could understand by non-computer majors. it is a double-edged sword
(maybe since is always double-edged sword).

-----------------------------------------------------
Guohun Zhu
.