Lower Bounds for QBFs of Bounded Treewidth.

Johannes Klaus Fichte Markus Hecher Andreas Pfandler

Published in: LICS (2020)

Keyphrases

bounded treewidth
lower bound
np complete
np hard
quantified boolean formulas
decision problems
branch and bound
conjunctive queries
objective function
highly parallelizable
optimal solution
fixed parameter tractable
boolean functions
relational learning
polynomial size
data model