Proof Compression and NP Versus PSPACE II
We upgrade [3] to a complete proof of the conjecture NP = PSPACE that is known as one of the fundamental open problems in the mathematical theory of computational complexity; this proof is based on [2]. Since minimal propositional logic is known to be PSPACE complete, while PSPACE to include NP, it...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Lodz University Press
2020-11-01
|
| Series: | Bulletin of the Section of Logic |
| Subjects: | |
| Online Access: | https://czasopisma.uni.lodz.pl/bulletin/article/view/8169 |