Critique of Feinstein's Proof that P is not Equal to NP
| dc.creator | Sabo, Kyle | |
| dc.creator | Schmitt, Ryan | |
| dc.creator | Silverman, Michael | |
| dc.date | 2007-06-14 | |
| dc.date.accessioned | 2026-07-07T08:10:01Z | |
| dc.date.available | 2026-07-07T08:10:01Z | |
| dc.description | 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. | |
| dc.description | 5 pages, 2 definitions | |
| dc.identifier | https://arxiv.org/abs/0706.2035 | |
| dc.identifier | http://arxiv.org/abs/0706.2035 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131718 | |
| dc.subject | Computational Complexity | |
| dc.title | Critique of Feinstein's Proof that P is not Equal to NP | |
| dc.type | text |