Pages that link to "Item:Q1853541"
From MaRDI portal
The following pages link to Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541):
Displaying 35 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← 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)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Using local search to find MSSes and MUSes (Q1042194) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- Extension and equivalence problems for clause minimal formulae (Q1777408) (← 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)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
- Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
- How Many Conflicts Does It Need to Be Unsatisfiable? (Q3502712) (← links)
- (Q4993600) (← links)
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)
