Pages that link to "Item:Q1887137"
From MaRDI portal
The following pages link to The complexity of minimal satisfiability problems (Q1887137):
Displayed 6 items.
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- Isomorphic implication (Q2272203) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)