Pages that link to "Item:Q5369245"
From MaRDI portal
The following pages link to On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (Q5369245):
Displaying 5 items.
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- NP-completeness of small conflict set generation for congruence closure (Q1688538) (← links)
- Efficient Generation of Small Interpolants in CNF (Q2864838) (← links)
- Parameterized and Exact Computation (Q5311515) (← links)
- Efficiently explaining CSPs with unsatisfiable subset optimization (Q6535423) (← links)