Preprint Article Version 2 This version is not peer-reviewed

P versus NP

Version 1 : Received: 1 August 2019 / Approved: 5 August 2019 / Online: 5 August 2019 (03:31:23 CEST)
Version 2 : Received: 26 November 2019 / Approved: 29 November 2019 / Online: 29 November 2019 (07:28:14 CET)

How to cite: Vega, F. P versus NP. Preprints 2019, 2019080037 (doi: 10.20944/preprints201908.0037.v2). Vega, F. P versus NP. Preprints 2019, 2019080037 (doi: 10.20944/preprints201908.0037.v2).

Abstract

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity classes are L and NL. We demonstrate if L is not equal to NL, then P = NP. In addition, we show if L is equal to NL, then P = NP. In this way, we prove the complexity class P is equal to NP.

Subject Areas

complexity classes; completeness; polynomial time; reduction; logarithmic space; one-way

Comments (1)

Comment 1
Received: 29 November 2019
Commenter: Frank Vega
Commenter's Conflict of Interests: Author
Comment: The document was changed. The title, abstract and keywords change as well. In this way, it is necessary to update the html page of the preprint site.
+ Respond to this comment

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 1
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.