APA Citation

Kyritsis, K. (2017). On the solution of the 3rd Clay Millennium problem. A short and elegant proof that P ≠ NP in the context of deterministic turing machines and Zermelo-Frankel set theory.

Chicago Style Citation

Kyritsis, Konstantinos. On the Solution of the 3rd Clay Millennium Problem. A Short and Elegant Proof That P ≠ NP in the Context of Deterministic Turing Machines and Zermelo-Frankel Set Theory. 2017.

MLA Citation

Kyritsis, Konstantinos. On the Solution of the 3rd Clay Millennium Problem. A Short and Elegant Proof That P ≠ NP in the Context of Deterministic Turing Machines and Zermelo-Frankel Set Theory. 2017.

Warning: These citations may not always be 100% accurate.