The following pages link to On the Hardness of Losing Weight (Q3521957):
Displaying 7 items.
- Local search: is brute-force avoidable? (Q439931) (← links)
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)
- Constraint Satisfaction Parameterized by Solution Size (Q3012823) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
