Pages that link to "Item:Q1759685"
From MaRDI portal
The following pages link to A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685):
Displaying 9 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- (Q3058694) (redirect page) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
- (Q4993600) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
