Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.
Jacob FockeDániel MarxFionn Mc InerneyDaniel NeuenGovind S. SankarPhilipp SchepperPhilip WellnitzPublished in: CoRR (2023)
Keyphrases
- bounded treewidth
- np complete
- conjunctive queries
- tight complexity bounds
- monadic datalog
- fixed parameter tractable
- query answering
- data complexity
- decision procedures
- decision problems
- boolean functions
- integrity constraints
- query evaluation
- query language
- np hard
- special case
- computational complexity
- phase transition
- machine learning
- database
- data integration
- description logics
- relational learning
- query rewriting
- business intelligence
- satisfiability problem
- expert systems