Pages that link to "Item:Q1765303"
From MaRDI portal
The following pages link to Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303):
Displaying 16 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)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Counting solutions to CSP using generating polynomials (Q2447541) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← 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)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)
