[1]
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, pp. 60–69, Oct. 2021.