Pages that link to "Item:Q1321054"

The following pages link to Decomposing constraint satisfaction problems using database techniques (Q1321054):

Displaying 34 items.

• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• On minimal constraint networks (Q359976) (← links)
• STR2: optimized simple tabular reduction for table constraints (Q429802) (← links)
• Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
• Constraint satisfaction -- algorithms and complexity analysis (Q672029) (← links)
• Hypertree decompositions and tractable queries (Q696962) (← links)
• Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
• A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
• Reformulating table constraints using functional dependencies-an application to explanation generation (Q941813) (← links)
• On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
• A fast algorithm for query optimization in universal-relation databases (Q1271615) (← links)
• Constraints, consistency and closure (Q1274280) (← links)
• Characterising tractable constraints (Q1321064) (← links)
• Accelerating new product development by overcoming complexity constraints (Q1371184) (← links)
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
• A comparison of structural CSP decomposition methods (Q1589639) (← links)
• Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
• Compiling constraint satisfaction problems (Q1606322) (← links)
• The power of propagation: when GAC is enough (Q1701225) (← links)
• Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
• A new tractable class of constraint satisfaction problems (Q1776199) (← links)
• Constraints in vision. Outline of a set-theoretic approach. (Q1808741) (← links)
• Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
• Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
• Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
• Partition search for non-binary constraint satisfaction (Q2372239) (← links)
• Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
• Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
• HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
• A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• Tractable constraints on ordered domains (Q5917444) (← links)
• Tractable constraints on ordered domains (Q5925572) (← links)
• An algebraic characterization of tractable constraints (Q6085763) (← links)