Pages that link to "Item:Q3523063"
From MaRDI portal
The following pages link to Tradeoffs in the Complexity of Backdoor Detection (Q3523063):
Displaying 13 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Backdoor sets for DLL subsolvers (Q862400) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (Q3502697) (← links)
- Computation of Renameable Horn Backdoors (Q3502704) (← links)
- Backdoors in the Context of Learning (Q3637159) (← links)
- Backdoor DNFs (Q6564620) (← links)