A new approach for a proof that P is NP

Malay Dutta, Anjana K. Mahanta

In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such…