Please use this identifier to cite or link to this item:
Title: The Simplest Possible Fully Correct Solution of the Clay Millennium Problem about P vs. NP. A Simple Proof That P ≠ NP = EXPTIME
Institution and School/Department of submitter: University of Ioannina, School of Economic and Administrative Sciences, Dept of Accouning-Finance
Subject classification: COMPUTER SCIENCE
Keywords: Computational Complexity,Polynomial time complexity,Non-deterministic polynomial time complexity,Exponential time complexity
Link: Journal of Computer and Communications Vol.11 No.8, August 2023 pp 181-194
Publisher: Scientific Research
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) - ΛΧ

Files in This Item:
File Description SizeFormat 
jcc_final_published_31_08_23.pdf358.11 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons