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.||URI:||http://cris.teiep.gr/jspui/handle/123456789/1560|
|Appears in Collections:||Εισηγήσεις|
Show full item record
Files in This Item:
|The_3rdClay_version2_Algorithms.pdf||203.71 kB||Adobe PDF||View/Open|
Items in CRIS are protected by copyright, with all rights reserved, unless otherwise indicated.