Pages that link to "Item:Q3524172"
From MaRDI portal
The following pages link to Beyond Hypertree Width: Decomposition Methods Without Decompositions (Q3524172):
Displaying 20 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Finding a given number of solutions to a system of fuzzy constraints (Q1745696) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
- How many variables are needed to express an existential positive query? (Q2322719) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Regularizing conjunctive features for classification (Q2662672) (← links)
- Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints (Q2820687) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
- Complexity Analysis of Generalized and Fractional Hypertree Decompositions (Q5056426) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← 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)