The following pages link to Solving #SAT Using Vertex Covers (Q5756553):
Displaying 5 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Learning to assign degrees of belief in relational domains (Q1009279) (← links)
- Algorithms for Propositional Model Counting (Q3498488) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (Q3502705) (← links)