Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth.
Petr KolmanMartin KouteckýPublished in: CoRR (2015)
Keyphrases
- bounded treewidth
- tractable classes
- np complete
- constraint satisfaction problems
- tractable cases
- highly parallelizable
- constraint programming
- random instances
- phase transition
- closest string
- conjunctive queries
- relational learning
- constraint satisfaction
- decision problems
- databases
- boolean functions
- np hard
- special case
- decomposition methods
- constraint propagation