A Counterexample to a Proposed Proof of P=NP by S Gubin
<|reference_start|>A Counterexample to a Proposed Proof of P=NP by S Gubin: In a recent paper by S. Gubin [cs/0701023v1], a polynomial-time solution to the 3SAT problem was presented as proof that P=NP. The proposed algorithm cannot be made to work, which I shall demonstrate.<|reference_end|>
@article{hegerle2007a,
    title={A Counterexample to a Proposed Proof of P=NP by S. Gubin},
    author={Blake Hegerle},
    journal={arXiv preprint arXiv:cs/0701033},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0701033},
    primaryClass={cs.CC}
}