Pages that link to "Item:Q452481"
From MaRDI portal
The following pages link to Complexity of partial satisfaction. II. (Q452481):
Displaying 5 items.
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← 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)
- Partial Satisfaction of k-Satisfiable Formulas (Q3503510) (← links)
