Pages that link to "Item:Q3656865"
From MaRDI portal
The following pages link to A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865):
Displaying 7 items.
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Note on Max Lin-2 above average (Q656604) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
