TE-ETH: Lower Bounds for QBFs of Bounded Treewidth.
Johannes Klaus FichteMarkus HecherAndreas PfandlerPublished in: CoRR (2019)
Keyphrases
- bounded treewidth
- lower bound
- np complete
- np hard
- quantified boolean formulas
- conjunctive queries
- decision problems
- branch and bound
- highly parallelizable
- boolean functions
- objective function
- optimal solution
- polynomial size
- relational learning
- utility function
- satisfiability problem
- computational complexity
- max sat
- fixed parameter tractable
- learning algorithm