Pages that link to "Item:Q2891342"
From MaRDI portal
The following pages link to Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342):
Displayed 9 items.
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← 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)
- Acyclic Digraphs (Q3120435) (← links)
- (Q4993600) (← links)