Re: more again: the complexity of Hamiltonian problem on 2-regular digraph

In article <1175062550.349229.228660@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
Zhu Guohun <ccghzhu@xxxxxxxxxxxxxxxxxxxx> wrote:
1) max-2 SAT problem which is a NP-completed problem as search from
google, but I could not find where is the orignal proof

This is Theorem 1.1 in Garey, Johnson and Stockmeyer, "Some simplified
NP-complete graph problems," Theoret. Comput. Sci. 1 (1976), 237-267.
--
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
.