Data Structures and Algorithms


P vs NP ... Are They Same ?

Authors: Hemant Pandey

P vs NP is possibly one of the most crucial problems’s of our era owing to the fact that it directly affects one of the most 8 basic things of our modern day survival, the Internet security. The proof will be surely a big blow to the RSA ciphering– 9 deciphering technology but it the way it is! Genuine apologies for P = NP. As for as mathematical gain is concern it is a 10 result that opens a search for solution of those 300 plus NP complete problems and much more. The present proof resolves 11 P = NP by the solution of NP complete Hamiltonians path problem in polynomial time. The proof is using topology and 12 simple geometry. Hence P = NP; solved for the Hamiltonians path problem or Traveling salesman problem as it is called 13 so. NP complete Hamiltonian’s path problem has a polynomial time solution, i.e. P =CN 4 for HPP. 14 2006 Published by Elsevier Inc.

Comments: 13 Pages. With drawl paper due to technical reasons.

Download: PDF

Submission history

[v1] 2016-07-23 09:09:27

Unique-IP document downloads: 832 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus