[FOM] [1305.5976] A Polynomial Time Algorithm for the Hamilton Circuit Problem
// ravi
ravi-lists at g8o.net
Wed May 29 19:57:01 EDT 2013
I haven’t seen this appear on the list, so:
http://arxiv.org/abs/1305.5976
> A Polynomial Time Algorithm for the Hamilton Circuit Problem
>
> Xinwen Jiang
> (Submitted on 26 May 2013)
> In this paper, we introduce a so-called Multistage graph Simple Path (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm and prove its NP-completeness. Our result implies NP=P.
—ravi
More information about the FOM
mailing list