Pages that link to "Item:Q3452226"
From MaRDI portal
The following pages link to Generalized hypertree decompositions: NP-hardness and tractable variants (Q3452226):
Displaying 30 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- Connected graph searching (Q690489) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- Finding compact scheme forests in nested normal form is NP-hard (Q1322463) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs (Q1929213) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Generalized hypertree decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
- Covers of Query Results (Q3305362) (← links)
- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- The power of non-ground rules in Answer Set Programming (Q4593042) (← links)
- Complexity Analysis of Generalized and Fractional Hypertree Decompositions (Q5056426) (← links)
- HyperBench (Q5102056) (← links)
- (Q5116496) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Fractional covers of hypergraphs with bounded multi-intersection (Q6057846) (← links)
- Fast parallel hypertree decompositions in logarithmic recursion depth (Q6536399) (← links)