Document Open Access Logo

Bounded-width QBF is PSPACE-complete

Authors Albert Atserias, Sergi Oliva

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2013.44.pdf
  • Filesize: 0.5 MB
  • 11 pages

Document Identifiers

Subject Classification

Keywords
  • Tree-width
  • QBF
  • PSPACE-complete

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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 whether the problem is tractable when restricted to instances of bounded tree-width.  We answer this question by showing that QBF on instances with constant tree-width is PSPACE-complete.

Cite As Get BibTex

Albert Atserias and Sergi Oliva. Bounded-width QBF is PSPACE-complete. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 44-54, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/LIPIcs.STACS.2013.44

Author Details

Albert Atserias
Sergi Oliva
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact