Pages that link to "Item:Q2342585"
From MaRDI portal
The following pages link to Structural tractability of enumerating CSP solutions (Q2342585):
Displaying 15 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Finding a given number of solutions to a system of fuzzy constraints (Q1745696) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Construction and optimization of CSG representations (Q2638718) (← links)
- CSP and Kripke Structures (Q2787446) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- (Q4253834) (← links)
- Sparsification of SAT and CSP Problems via Tractable Extensions (Q5053064) (← links)
- CSP gaps and reductions in the lasserre hierarchy (Q5172724) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Inter-block Backtracking: Exploiting the Structure in Continuous CSPs (Q5450794) (← links)
- The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems (Q5868883) (← links)