The following pages link to Backdoors to Satisfaction (Q2908542):
Displayed 21 items.
- Backdoors to q-Horn (Q261394) (← links)
- Structural decompositions for problems with global constraints (Q272005) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Backdoors to planning (Q2321271) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- (Q5009475) (← links)
- Backdoors into Two Occurrences (Q5014282) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS (Q5401598) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- (Q6089666) (← links)