Pages that link to "Item:Q696962"
From MaRDI portal
The following pages link to Hypertree decompositions and tractable queries (Q696962):
Displaying 23 items.
- 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)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (Q4911127) (← links)
- Complexity Analysis of Generalized and Fractional Hypertree Decompositions (Q5056426) (← links)
- (Q5092420) (← links)
- (Q5092423) (← links)
- HyperBench (Q5102056) (← links)
- On Sparse Discretization for Graphical Games (Q5130000) (← links)
- When is the evaluation of conjunctive queries tractable? (Q5176024) (← links)
- Schema Mappings: A Case of Logical Dynamics in Database Theory (Q5249666) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- A backtracking-based algorithm for hypertree decomposition (Q5406168) (← links)
- A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
- Linear Programs with Conjunctive Database Queries (Q6151558) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)
- Computing a partition function of a generalized pattern-based energy over a semiring (Q6174653) (← links)
- Fast parallel hypertree decompositions in logarithmic recursion depth (Q6536399) (← links)
