Article
Version 1
Preserved in Portico This version is not peer-reviewed
Proof that P ≠ NP
Version 1
: Received: 23 July 2020 / Approved: 24 July 2020 / Online: 24 July 2020 (13:53:24 CEST)
How to cite: Samuels, J.I. Proof that P ≠ NP. Preprints 2020, 2020070588. https://doi.org/10.20944/preprints202007.0588.v1 Samuels, J.I. Proof that P ≠ NP. Preprints 2020, 2020070588. https://doi.org/10.20944/preprints202007.0588.v1
Abstract
The question does P = NP has confounded mathematicians and computer scientists alike for over 50 years and although there is an almost unanimous agreement that it in fact does not, there still is no absolute proof. In this paper, I attempt to prove to that P does not equal NP.
Keywords
Computational Complexity; Probability; Mathematics
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (2)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
Commenter:
The commenter has declared there is no conflict of interests.
Commenter: Jamell Ivan Samuels
The commenter has declared there is no conflict of interests.