Kyle Sabo

Learn More
We examine a proof by Craig Alan Feinstein that P = N P. 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(More)
  • 1