Proof Compression and NP Versus PSPACE II: Addendum

DOI10.18778/0138-0680.2022.01arXiv2011.09262MaRDI QIDQ6119340

Edward Hermann Haeusler, L. N. Gordeev

Publication date: 29 February 2024

Published in: Bulletin of the Section of Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.09262

zbMATH Keywords

computational complexitygraph theorynatural deduction

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Intuitionistic propositional logic is polynomial-space complete
• Proof compression and NP versus PSPACE
• An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic
• Proof Compression and NP Versus PSPACE II
• Computational Complexity

This page was built for publication: Proof Compression and NP Versus PSPACE II: Addendum