Pages that link to "Item:Q1961649"
From MaRDI portal
The following pages link to Two tractable subclasses of minimal unsatisfiable formulas (Q1961649):
Displaying 17 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- The complexity of variable minimal formulas (Q708020) (← links)
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560) (← links)
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF (Q1277336) (← links)
- The complexity of minimum partial truth assignments and implication in negation-free formulae (Q1380416) (← 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)
- On subclasses of minimal unsatisfiable formulas (Q1841884) (← 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)
- Generating clause sequences of a CNF formula (Q2219060) (← links)
- Satisfiable formulas closed under replacement (Q2741513) (← links)
- Minimally unsatisfiable \(CNF\) formulas (Q2743691) (← links)
- On Minimum Representations of Matched Formulas (Q2938476) (← links)
- On Variables with Few Occurrences in Conjunctive Normal Forms (Q3007672) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463945) (← links)
