Pages that link to "Item:Q1853126"

The following pages link to Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. (Q1853126):

Displayed 2 items.

• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) ‎ (← links)
• The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) ‎ (← links)