![Author ORCID: We display the ORCID iD icon alongside authors names on our website to acknowledge that the ORCiD has been authenticated when entered by the user. To view the users ORCiD record click the icon. [opens in a new tab]](https://www.cambridge.org/engage/assets/public/coe/logo/orcid.png){kind=logo}
Abstract
One of the biggest unsolved mysteries in computer science is the P versus NP problem. It asks a simple question: can every problem whose solution can be quickly verified be solved just as quickly (Here, "quickly" means in polynomial time)? While the question itself was hinted at in a 1955 letter from John Nash, a formalization of the problem is credited to Stephen Cook and Leonid Levin. Despite decades of effort, no one has been able to definitively answer it. Closely related is the concept of NP-completeness. If even one NP-complete problem can be solved efficiently (in polynomial time), then it implies P equals NP. This work proposes that a specific NP-complete problem, ONE-IN-THREE 3SAT, can be solved efficiently. In this way, we prove that P is equal to NP.
