QBF solving is FPT given small clausal deletion backdoors to 2-CNF or linear equations but W[1]-hard for Horn, with one case left for a full dichotomy.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
QBF solving is FPT given small clausal deletion backdoors to 2-CNF or linear equations but W[1]-hard for Horn, with one case left for a full dichotomy.