The following pages link to Backdoor treewidth for SAT (Q1680239):
Displaying 8 items.
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Solving <i>d-</i>SAT via Backdoors to Small Treewidth (Q5363089) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
- (Q6168493) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)
