P versus NP

Frank Vega
2019 Zenodo  
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,
more » ... L is equal to NL, then P = NP. In this way, we prove the complexity class P is equal to NP.
doi:10.5281/zenodo.3552502 fatcat:tmw3twbetvbofi6h3ocrpwwif4