Pages that link to "Item:Q1841884"
From MaRDI portal
The following pages link to On subclasses of minimal unsatisfiable formulas (Q1841884):
Displaying 16 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Using local search to find MSSes and MUSes (Q1042194) (← links)
- On the structure of some classes of minimal unsatisfiable formulas (Q1408380) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. (Q1853126) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- On Variables with Few Occurrences in Conjunctive Normal Forms (Q3007672) (← links)
- How Many Conflicts Does It Need to Be Unsatisfiable? (Q3502712) (← links)
- The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
