Pages that link to "Item:Q5395737"

The following pages link to Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries (Q5395737):

Displaying 24 items.

• Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Structural decompositions for problems with global constraints (Q272005) (← links)
• Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
• Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
• It's all a matter of degree. Using degree information to optimize multiway joins (Q1650915) (← links)
• Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
• Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
• Regularizing conjunctive features for classification (Q2662672) (← links)
• (Q3305351) (← links)
• Fractional Edge Cover Number of Model RB (Q4632176) (← links)
• (Q4993594) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
• (Q5091136) (← links)
• (Q5092420) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
• On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)
• Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)