Does NP not equal P?

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

withdrawn. It was a rediculously absurd notion

Scientific paper

Stephen Cook posited SAT is NP-Complete in 1971. If SAT is NP-Complete then, as is generally accepted, any polynomial solution of it must also present a polynomial solution of all NP decision problems. It is here argued, however, that NP is not of necessity equivalent to P where it is shown that SAT is contained in P. This due to a paradox, of nature addressed by both Godel and Russell, in regards to the P-NP system in total.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Does NP not equal P? 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 Does NP not equal P?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Does NP not equal P? will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-368703

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.