Pages that link to "Item:Q931717"

The following pages link to A unified theory of structural tractability for constraint satisfaction problems (Q931717):

Displaying 19 items.

• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• Structural decompositions for problems with global constraints (Q272005) (← links)
• Modularity-based decompositions for valued CSP (Q353312) (← links)
• Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
• A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
• On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
• Approximability of clausal constraints (Q970111) (← links)
• Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
• Solving nonograms by combining relaxations (Q1023434) (← links)
• The power of propagation: when GAC is enough (Q1701225) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
• Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
• Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
• Algorithms for propositional model counting (Q2266937) (← links)
• Structural tractability of enumerating CSP solutions (Q2342585) (← links)
• Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)