Pages that link to "Item:Q1853126"
From MaRDI portal
The following pages link to Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. (Q1853126):
Displaying 4 items.
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)