Please use this identifier to cite or link to this item:
Title: The solution of the 3RD clay millennium problem. A short proof that P≠NP=EXPTIME in the context of Zermelo-Frankel set theory
Authors: Kyritsis, Constantinos 
Keywords: Computational Complexity;Υπολογιστική πολυπλοκότητα
Issue Date: 10-Aug-2017
Abstract: In this paper I provide a very short but decisive proof that P ≠ NP, anf NP=EXPTIME in the context of the ZF set theory and deterministic Turing machines. We discuss also the subtle implications of considering the P versus NP problem, in different axiomatic theories! The results of the current paper definitely solve the 3rd Clay Millennium problem 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.
Appears in Collections:Εισηγήσεις

Files in This Item:
File Description SizeFormat 
The_3rdClay_version2_Algorithms.pdf203.71 kBAdobe PDFView/Open
Show full item record

Google ScholarTM


Items in CRIS are protected by copyright, with all rights reserved, unless otherwise indicated.