Now showing items 1-1 of 1
Proof Compression and NP Versus PSPACE II
(Wydawnictwo Uniwersytetu Łódzkiego, 2020-11-04)
We upgrade  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 . Since minimal ...