Proof compression and NP versus PSPACE. Part 2
Logic in Computer Science
2022-01-11 v2
Abstract
We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)
Cite
@article{arxiv.1907.03858,
title = {Proof compression and NP versus PSPACE. Part 2},
author = {Lev Gordeev},
journal= {arXiv preprint arXiv:1907.03858},
year = {2022}
}
Comments
12 pages