A Constructive Algorithm to Prove P=NP

TL;DR

This paper presents a constructive polynomial-time algorithm for solving the Hamiltonian cycle problem, claiming to prove that P equals NP by reducing the problem to a special TSP and solving it effectively.

Contribution

The paper introduces a novel constructive algorithm that solves the Hamiltonian cycle problem in polynomial time, aiming to prove P=NP.

Findings

Algorithm solves Hamiltonian cycle in polynomial time

Reduction of Hamiltonian cycle to TSP with cost 0 or 1

Claimed proof that P=NP

Abstract

After reducing the undirected Hamiltonian cycle problem into the TSP problem with cost 0 or 1, we developed an effective algorithm to compute the optimal tour of the transformed TSP. Our algorithm is described as a growth process: initially, constructing 4-vertexes optimal tour; next, one new vertex being added into the optimal tour in such a way to obtain the new optimal tour; then, repeating the previous step until all vertexes are included into the optimal tour. This paper has shown that our constructive algorithm can solve the undirected Hamiltonian cycle problem in polynomial time. According to Cook-Levin theorem, we argue that we have provided a constructive proof of P=NP.