Pages that link to "Item:Q4380447"
From MaRDI portal
The following pages link to A fast deterministic algorithm for formulas that have many satisfying assignments (Q4380447):
Displaying 7 items.
- A short implicant of a CNF formula with many satisfying assignments (Q727982) (← links)
- Solving and sampling with many solutions (Q2309479) (← links)
- A Short Implicant of a CNF Formula with Many Satisfying Assignments (Q2942635) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)
- A quantum differentiation of<i>k</i>-SAT instances (Q5131404) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
