figshare
Browse
manuscript.pdf (252.46 kB)

P versus NP

Download (252.46 kB)
Version 12 2018-04-25, 16:42
Version 11 2018-04-25, 14:32
Version 10 2018-04-25, 11:47
Version 9 2018-04-24, 21:51
Version 8 2018-04-24, 21:38
Version 7 2018-04-24, 21:13
Version 6 2018-04-24, 17:55
Version 5 2018-04-21, 14:43
Version 4 2018-04-20, 13:05
Version 3 2018-04-20, 12:54
Version 2 2018-04-19, 15:47
Version 1 2018-04-19, 12:50
journal contribution
posted on 2018-04-25, 16:42 authored by Frank VegaFrank Vega
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? This question was first mentioned in a letter written by John Nash to the National Security Agency in 1955. A precise statement of the P versus NP problem was introduced independently in 1971 by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is Sharp-P. Whether P = Sharp-P is another fundamental question that it is as important as it is unresolved. If any single Sharp-P-complete problem can be solved in polynomial time, then every NP problem has a polynomial time algorithm. The problem Sharp-MONOTONE-2SAT is known to be Sharp-P-complete. We prove Sharp-MONOTONE-2SAT is in P. In this way, we demonstrate the P versus NP problem.

History