A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin

Details A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin

2008-04-16

arxiv.org/abs/0804.2699v1

Computer Science

Computational Complexity

Scientific paper

This paper refutes the validity of the polynomial-time algorithm for solving satisfiability proposed by Sergey Gubin. Gubin introduces the algorithm using 3-SAT and eventually expands it to accept a broad range of forms of the Boolean satisfiability problem. Because 3-SAT is NP-complete, the algorithm would have implied P = NP, had it been correct. Additionally, this paper refutes the correctness of his polynomial-time reduction of SAT to 2-SAT.

Affiliated with

Also associated with

No associations

Rating

A Critique of a Polynomial-time SAT Solver Devised by Sergey 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 Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-506278