Pages that link to "Item:Q1961649"
From MaRDI portal
The following pages link to Two tractable subclasses of minimal unsatisfiable formulas (Q1961649):
Displaying 5 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- The complexity of variable minimal formulas (Q708020) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- On Variables with Few Occurrences in Conjunctive Normal Forms (Q3007672) (← links)
