Pages that link to "Item:Q1277336"

The following pages link to An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF (Q1277336):

Displaying 27 items.

• Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
• On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
• Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
• Generalization of the Chinese remainder theorem (Q946010) (← links)
• Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
• An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
• An approach for extracting a small unsatisfiable core (Q1028724) (← 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)
• Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
• Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
• Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
• The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← 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)
• On the complexity of inconsistency measurement (Q2321337) (← links)
• Local-search extraction of mUSes (Q2385174) (← links)
• 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 (Q2732529) (← links)
• On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
• On Variables with Few Occurrences in Conjunctive Normal Forms (Q3007672) (← links)
• The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
• Finding the Hardest Formulas for Resolution (Q5154766) (← links)
• Towards logical operations research -- propositional case (Q5957908) (← links)
• The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant (Q6158363) (← links)