Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/33044| 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 |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/33044 http://dx.doi.org/10.26268/heal.uoi.12843 |
| 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 | Size | Format | |
|---|---|---|---|---|
| jcc_final_published_31_08_23.pdf | 358.11 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
