Critique of Feinstein's Proof that P is not Equal to NP

Details Critique of Feinstein's Proof that P is not Equal to NP Critique of Feinstein's Proof that P is not Equal to NP

2007-06-14

arxiv.org/abs/0706.2035v1

Computer Science

Computational Complexity

5 pages, 2 definitions

Scientific paper

We examine a proof by Craig Alan Feinstein that P is not equal to NP. We present counterexamples to claims made in his paper and expose a flaw in the methodology he uses to make his assertions. The fault in his argument is the incorrect use of reduction. Feinstein makes incorrect assumptions about the complexity of a problem based on the fact that there is a more complex problem that can be used to solve it. His paper introduces the terminology "imaginary processor" to describe how it is possible to beat the brute force reduction he offers to solve the Subset-Sum problem. The claims made in the paper would not be validly established even were imaginary processors to exist.

Affiliated with

Also associated with

No associations

Rating

Critique of Feinstein's Proof that P is not Equal to NP 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 Critique of Feinstein's Proof that P is not Equal to NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critique of Feinstein's Proof that P is not Equal to NP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330497