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.

Main Author: Konstantinos Kyritsis
Format: Paper
Language: English
Published: 2017
Online Access: http://cris.teiep.gr/jspui/handle/123456789/1482
Be the first to leave a comment!
Your Comment