Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth.
Petr KolmanMartin KouteckýPublished in: Electron. J. Comb. (2015)
Keyphrases
- bounded treewidth
- tractable classes
- np complete
- constraint satisfaction problems
- tractable cases
- highly parallelizable
- decision problems
- closest string
- np hard
- conjunctive queries
- constraint propagation
- random instances
- constraint satisfaction
- relational learning
- decomposition method
- decomposition methods
- tree decomposition
- reasoning problems
- boolean functions
- data warehouse
- computational complexity