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

Zhu Guohun <ccghzhu@xxxxxxxxxxxxxxxxxxxx> writes:
<snip>
The MAX2SAT problem is solved in polynomial, and I have been submit it
to http://arxiv.org/abs/0801.2447 (maybe it also show a little
later).

Just a "heads up": For me, the link takes me to a log-in page, and my
attempt to register failed.

--
Ben.
.