The following pages link to Backdoor sets for DLL subsolvers (Q862400):
Displaying 11 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (Q3502697) (← links)
- Computation of Renameable Horn Backdoors (Q3502704) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
- Backdoors in the Context of Learning (Q3637159) (← links)
