Search
 
loader loading subjects...
cover
Yet Another (Fake) Proof of P=NP
Carlos Ansótegui, Jordi Levy
25 - 34
10.3233/FAIA220310
Research Article
Frontiers in Artificial Intelligence and Applications
Volume 356: Artificial Intelligence Research and Development
Abstract

Obviously, we do not prove P = NP in this article. In fact, the title only refers to the first part, where the proof that we present contains an error that, to make reading more attractive, is only revealed in the second part.

In the second part, we describe how the reduction of SAT to Max2XOR and the proof system presented in the first part –although they do not solve one of the Millennium Prize Problems– may trigger new complementary ways of solving the SAT problem.

Download
Creative Commons License