Review of the Solutions of the Clay Millennium Problem about P ≠ NP =EXPTIME

Konstantinos E. Kyritsis

3rd Clay Millennium problem, EXPTIME-complete problems, NP-complexity, P-complexity Mathematical Subject Classification: 68Q15.

In this paper I review the decisive proofs that P ≠ NP, and    NP=EXPTIME   in the context of the Zermelo-Frankel set theory and deterministic Turing machines. The results of these proofs   definitely solve the 3rd Clay Millennium Problem about P versus NP, in a simple and transparent away that the general scientific community, but also the experts of the area, can follow, understand and therefore become able to accept. So far the solutions of this famous problem seem that they have not been noticed by the wider relevant scientific community. The main purpose of this paper is to make widely known the solutions of the 3rd Clay Millennium problem “P versus NP” to the relevant scientific community.

https://doi.org/10.31871/WJRR.13.3.8