Bulletin of the Section of Logic > 2022 > 51 > 2 > 197-205
Source
Abstract
Identifiers
journal ISSN : | 2449-836X , 0138-0680 |
DOI | 10.18778/0138-0680.2022.01 |
Authors
Keywords
Additional information
Publisher
Fields of science
Bibliography
-
S. Arora, B. Barak, Computational Complexity: A Modern Approach, Cambridge University Press (2009).
-
L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica, vol. 107(1) (2019), pp. 55–83, DOI: https://doi.org/10.1007/s11225-017-9773-5
-
L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE II, Bulletin of the Section of Logic, vol. 49(3) (2020), pp. 213–230, DOI: https://doi.org/10.18778/0138-0680.2020.16