Pages that link to "Item:Q3581534"

The following pages link to Constraint solving via fractional edge covers (Q3581534):

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)
• Edge covering problem under hybrid uncertain environments (Q371513) (← links)
• Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
• Computing hypergraph width measures exactly (Q437685) (← 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)
• A more general theory of static approximations for conjunctive queries (Q778535) (← links)
• Constraint satisfaction with bounded treewidth revisited (Q847262) (← 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)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
• Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
• Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
• Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← 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)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• Answering conjunctive queries with inequalities (Q2402612) (← links)
• Hypertree width and related hypergraph invariants (Q2461773) (← links)
• Regularizing conjunctive features for classification (Q2662672) (← links)
• Computing partial hypergraphs of bounded width (Q2686128) (← links)
• Generalized hypertree decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
• Covers of Query Results (Q3305362) (← 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)
• Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
• Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
• Fractional Edge Cover Number of Model RB (Q4632176) (← links)
• ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS (Q4956347) (← links)
• (Q4962162) (redirect page) (← links)
• (Q5089208) (← links)
• (Q5091136) (← links)
• (Q5092420) (← links)
• (Q5092423) (← links)
• HyperBench (Q5102056) (← links)
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• (Q5743434) (← links)
• Fractional covers of hypergraphs with bounded multi-intersection (Q6057846) (← links)
• Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
• (Q6068932) (← links)
• (Q6089669) (← links)
• Linear Programs with Conjunctive Database Queries (Q6151558) (← links)
• Computing a partition function of a generalized pattern-based energy over a semiring (Q6174653) (← links)