The following pages link to Solving \#SAT using vertex covers (Q2464035):
Displaying 11 items.
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Tensor network contractions for \#SAT (Q887094) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
- Computation of Renameable Horn Backdoors (Q3502704) (← links)
- Backdoors into Two Occurrences (Q5014282) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
