The Mathematics of P vs NP by hemant pandey - HTML preview

291

292

293

294

295

296

297

298

299

Mathematically NP completeness is the generalization of NP problems. In order to prove or disprove P = NP, we have to prove or disprove it for one of those 3000 NP complete general, problems.

2.2     RESULT:

We propose a new result P =NP; We will establish this result for NP complete Hamiltonian’s path problem, or Euclidean Traveling salesman’s problem. We will  find an optimal tour for ETSP with the help of geometrical and topological properties of polygons.

Our proof aims to solve Hamiltonian’s path problem or Euclidean Traveling salesman’s problem in polynomial time of fifth degree at most.

300

301

302

i.e. for HPP or TSP

We propose P =Cn5 at most, i.e. NP complete ETSP can be effectively solved in polynomial time of order 5.

303