Response to Refutation of Aslam's Proof that NP = P

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Total 6 pages, including one figure

Scientific paper

We present a resolution to the refutation provided by Ferraro et. al
(arXiv:0904.3912), for the proof of $NP=P$ in [arXiv:0812.1385]. We also
provide a correct solution to the counter example and additional results that
explain why some issues raised in the cited refutation are not quite valid.

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

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

Rate now

     

Profile ID: LFWR-SCP-O-180438

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