Pages that link to "Item:Q1591157"

The following pages link to Conjunctive-query containment and constraint satisfaction (Q1591157):

Displaying 50 items.

• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• Colouring, constraint satisfaction, and complexity (Q458466) (← links)
• Conjunctive query containment over trees (Q532363) (← links)
• Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
• On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
• Hypertree decompositions and tractable queries (Q696962) (← links)
• Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
• The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
• On the complexity of entailment in existential conjunctive first-order logic with atomic negation (Q714500) (← links)
• A more general theory of static approximations for conjunctive queries (Q778535) (← links)
• The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
• Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
• Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
• Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
• A new line of attack on the dichotomy conjecture (Q896081) (← links)
• A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
• Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
• On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
• A comparison of structural CSP decomposition methods (Q1589639) (← links)
• Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Conjunctive query containment over trees using schema information (Q1702301) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
• The complexity of minimal satisfiability problems (Q1887137) (← links)
• Generalization of ZYT-linearizability for bilinear datalog programs (Q1887164) (← links)
• The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
• Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
• Efficiently enumerating minimal triangulations (Q1983135) (← links)
• Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
• Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
• Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255) (← links)
• Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
• Algorithms for propositional model counting (Q2266937) (← links)
• Structural tractability of enumerating CSP solutions (Q2342585) (← links)
• From tree-decompositions to clique-width terms (Q2413974) (← links)
• On digraph coloring problems and treewidth duality (Q2427534) (← links)
• Majority constraints have bounded pathwidth duality (Q2427535) (← links)
• Counting solutions to CSP using generating polynomials (Q2447541) (← links)
• A combinatorial characterization of resolution width (Q2475405) (← links)
• Complexity of clausal constraints over chains (Q2480746) (← links)
• Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• Conjunctive Visibly-Pushdown Path Queries (Q2947891) (← links)
• Many Facets of Dualities (Q2971613) (← links)
• An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)