Published July 30, 2018
| Version v1
Report
Open
P versus NP
Description
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? To attack the P = NP question the concept of NP-completeness is very useful. If any single NP-complete problem is in P, then P = NP. We prove there is a problem in NP-complete and P. Therefore, we demonstrate P = NP.
Notes
Files
manuscript.pdf
Files
(273.9 kB)
Name | Size | Download all |
---|---|---|
md5:92c1895e6e8e4468a5bdc9c993dbc93c
|
273.9 kB | Preview Download |