LSPACE vs NP is as hard as P vs NP
Description
The P versus NP problem is a major unsolved problem in computer science. This consists in knowing the answer of the following question: Is P equal to NP? Another major complexity classes are LSPACE, PSPACE and EXP. Whether LSPACE = P is a fundamental question that it is as important as it is unresolved. We show if P = NP, then LSPACE = NP. Consequently, if LSPACE is not equal to NP, then P is not equal to NP. According to Lance Fortnow, it seems that LSPACE versus NP is easier to be proven. However, with this proof we show this problem is as hard as P versus NP. Moreover, we prove the complexity class P is not equal to PSPACE as a direct consequence of this result. Furthermore, we demonstrate if PSPACE is not equal to EXP, then P is not equal to NP.
Files
report.pdf
Files
(208.5 kB)
Name | Size | Download all |
---|---|---|
md5:2368b53b84a51bada4ec870e700ab52e
|
208.5 kB | Preview Download |