Pages that link to "Item:Q1430293"
From MaRDI portal
The following pages link to Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems (Q1430293):
Displayed 6 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
- Backdoors in the Context of Learning (Q3637159) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)