Constraint satisfaction with bounded treewidth revisited
From MaRDI portal
(Redirected from Publication:847262)
Recommendations
- Constraint Satisfaction with Bounded Treewidth Revisited
- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
- Bounded Tree-Width and CSP-Related Problems
- Answer set solving with bounded treewidth revisited
- Extended formulation for CSP that is compact for instances of bounded treewidth
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- The Polytope of Tree-Structured Binary Constraint Satisfaction Problems
- Tree dualities for constraint satisfaction
- The complexity of constraint satisfaction revisited
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1834638 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- A sufficient condition for backtrack-bounded search
- Algorithms for Propositional Model Counting
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- Conjunctive-query containment and constraint satisfaction
- Constraint Satisfaction with Bounded Treewidth Revisited
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Graph-Theoretic Concepts in Computer Science
- Hypertree decompositions and tractable queries
- On the complexity of database queries
- Parametrized complexity theory.
- Some simplified NP-complete graph problems
- Theory and Applications of Satisfiability Testing
- Tree clustering for constraint networks
- Which problems have strongly exponential complexity?
Cited in
(35)- Parametrised complexity of satisfiability in temporal logic
- Does Treewidth Help in Modal Satisfiability?
- On the complexity of winner determination and strategic control in conditional approval voting
- On the expressive power of CNF formulas of bounded tree- and clique-width
- Grundy Distinguishes Treewidth from Pathwidth
- Tractability in constraint satisfaction problems: a survey
- Constraint Satisfaction with Bounded Treewidth Revisited
- Complexity and approximability of parameterized MAX-CSPs
- SAT backdoors: depth beats size
- Backdoors into heterogeneous classes of SAT and CSP
- Algorithmic applications of tree-cut width
- Parameterized complexity of constraint satisfaction problems
- New width parameters for SAT and \#SAT
- Slim tree-cut width
- Solving infinite-domain CSPs using the patchwork property
- Can you beat treewidth?
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Does treewidth help in modal satisfiability? (Extended abstract)
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
- Algorithms and complexity of difference logic
- Answer set solving with bounded treewidth revisited
- Extended formulation for CSP that is compact for instances of bounded treewidth
- Grundy distinguishes treewidth from pathwidth
- Combining treewidth and backdoors for CSP
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Bounded Tree-Width and CSP-Related Problems
- On the complexity of some colorful problems parameterized by treewidth
- New limits of treewidth-based tractability in optimization
- Treewidth with a quantifier alternation revisited
- On the parameterized complexity of freezing dynamics
- On the power of structural decompositions of graph-based representations of constraint problems
- Algorithmic applications of tree-cut width
- Sum-of-Products with Default Values: Algorithms and Complexity Results
- On the impact of treewidth in the computational complexity of freezing dynamics
- Slim tree-cut width
This page was built for publication: Constraint satisfaction with bounded treewidth revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847262)
