Konstantinos E. Kyritsis. Study on the Solution of the Clay Millennium Problem about the P vs NP: A Short Proof that P \(\neq\) NP=EXPTIME in the Context of Deterministic Turing Machines. NVST-V6 [Internet]. 2021 Oct. 2 [cited 2026 Jun. 4];:60-9. Available from: https://stm.bookpi.org/NVST-V6/article/view/4135