Pages that link to "Item:Q3192058"
From MaRDI portal
The following pages link to On Reducing Maximum Independent Set to Minimum Satisfiability (Q3192058):
Displaying 4 items.
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- A non-clausal tableau calculus for \textsc{MinSat} (Q2234795) (← links)
