QBF is PSpace-hard for constant-size backdoors to Horn, 2-SAT and affine but admits FPT algorithms and detection via enhanced backdoors (primal-graph separators including universal components) when parameterized by backdoor size plus quantifier depth.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Backdoors for Quantified Boolean Formulas
QBF is PSpace-hard for constant-size backdoors to Horn, 2-SAT and affine but admits FPT algorithms and detection via enhanced backdoors (primal-graph separators including universal components) when parameterized by backdoor size plus quantifier depth.