Pages that link to "Item:Q2930305"

The following pages link to Approximating fractional hypertree width (Q2930305):

Displaying 16 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)
• Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• Efficiently enumerating minimal triangulations (Q1983135) (← links)
• Structural tractability of enumerating CSP solutions (Q2342585) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
• Covers of Query Results (Q3305362) (← links)
• Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
• HyperBench (Q5102056) (← links)
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
• (Q5743434) (← links)
• Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries (Q6135781) (← links)