Pages that link to "Item:Q3906440"
From MaRDI portal
The following pages link to Complexity of Partial Satisfaction (Q3906440):
Displaying 17 items.
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Complexity of partial satisfaction. II. (Q452481) (← links)
- On existence theorems (Q686508) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- Implications of forbidden structures for extremal algorithmic problems (Q1082812) (← links)
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- Checking robust nonsingularity is NP-hard (Q1802197) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← 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)
- (Q4993600) (← links)
