Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- From: tchow@xxxxxxxxxxxxx
- Date: 28 Mar 2007 18:09:29 GMT
In article <1175062550.349229.228660@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
Zhu Guohun <ccghzhu@xxxxxxxxxxxxxxxxxxxx> wrote:
So where do I submit my draft ?
If you have actually produced a correct proof that P = NP, then the
best thing to do is to submit it to http://arxiv.org That's what
Perelman did with his proof of the Poincare conjecture.
--
Tim Chow tchow-at-alum-dot-mit-dot-edu
The range of our projectiles---even ... the artillery---however great, will
never exceed four of those miles of which as many thousand separate us from
the center of the earth. ---Galileo, Dialogues Concerning Two New Sciences
.
- References:
- Prev by Date: Where I can find discussion about quantum computing
- Next by Date: Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- Previous by thread: more again: the complexity of Hamiltonian problem on 2-regular digraph
- Next by thread: Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- Index(es):