Pages that link to "Item:Q730498"
From MaRDI portal
The following pages link to Backdoors into heterogeneous classes of SAT and CSP (Q730498):
Displaying 12 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Backdoors to planning (Q2321271) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)
