Pages that link to "Item:Q696962"

The following pages link to Hypertree decompositions and tractable queries (Q696962):

Displaying 50 items.

• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Structural decompositions for problems with global constraints (Q272005) (← links)
• On minimal constraint networks (Q359976) (← links)
• Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← 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)
• Generic local computation (Q414892) (← links)
• Computing hypergraph width measures exactly (Q437685) (← links)
• Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs (Q456059) (← links)
• Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons (Q506166) (← links)
• Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
• Connectivity and equilibrium in random games (Q549865) (← links)
• Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
• Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
• A more general theory of static approximations for conjunctive queries (Q778535) (← links)
• Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
• Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
• Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
• Coalition structure generation: a survey (Q900307) (← 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)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs (Q1929213) (← links)
• Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
• Efficiently enumerating minimal triangulations (Q1983135) (← links)
• Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
• Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
• Algorithms for propositional model counting (Q2266937) (← links)
• Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
• Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
• Structural tractability of enumerating CSP solutions (Q2342585) (← links)
• Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
• Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
• Answering conjunctive queries with inequalities (Q2402612) (← links)
• Hypertree width and related hypergraph invariants (Q2461773) (← links)
• Regularizing conjunctive features for classification (Q2662672) (← links)
• Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
• Semantic Acyclicity on Graph Databases (Q3187172) (← links)
• A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
• Algorithms for Propositional Model Counting (Q3498488) (← links)
• Dynamic Management of Heuristics for Solving Structured CSPs (Q3523068) (← links)
• Tree-Width for First Order Formulae (Q3644741) (← links)
• HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
• Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)