Highly Influenced

# Bounded-width QBF is PSPACE-complete

@inproceedings{Atserias2013BoundedwidthQI, title={Bounded-width QBF is PSPACE-complete}, author={Albert Atserias and Sergi Oliva}, booktitle={STACS}, year={2013} }

- Published in STACS 2013
DOI:10.4230/LIPIcs.STACS.2013.44

Tree-width is a well-studied parameter of structures that measures their similarity to a tree. Many important NP-complete problems, such as Boolean satisfiability (SAT), are tractable on bounded tree-width instances. In this paper we focus on the canonical PSPACE-complete problem QBF, the fully-quantified version of SAT. It was shown by Pan and Vardi [LICS 2006] that this problem is PSPACE-complete even for formulas whose tree-width grows extremely slowly. Vardi also posed the question ofâ€¦Â CONTINUE READING