Pages that link to "Item:Q727982"
From MaRDI portal
The following pages link to A short implicant of a CNF formula with many satisfying assignments (Q727982):
Displaying 4 items.
- Inclusion-exclusion for \(k\)-CNF formulas (Q1014406) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- A fast deterministic algorithm for formulas that have many satisfying assignments (Q4380447) (← links)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)