Pages that link to "Item:Q847262"
From MaRDI portal
The following pages link to Constraint satisfaction with bounded treewidth revisited (Q847262):
Displaying 20 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5111886) (← links)
- Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
- (Q5874480) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- On the parameterized complexity of freezing dynamics (Q6499443) (← links)
