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? 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.
Files
manuscript.pdf
Files
(436.6 kB)
Name | Size | Download all |
---|---|---|
md5:2e7965076ebadc5a8aabacd714d5dc9c
|
436.6 kB | Preview Download |