A Counterexample to a Proposed Proof of P=NP by S. Gubin

Details A Counterexample to a Proposed Proof of P=NP by S. Gubin A Counterexample to a Proposed Proof of P=NP by S. Gubin

2007-01-05

arxiv.org/abs/cs/0701033v1

Computer Science

Computational Complexity

2 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Counterexample to a Proposed Proof of P=NP by S. Gubin does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Counterexample to a Proposed Proof of P=NP by S. Gubin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Counterexample to a Proposed Proof of P=NP by S. Gubin will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16122