Pages that link to "Item:Q456705"
From MaRDI portal
The following pages link to The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705):
Displaying 11 items.
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- Fast local search methods for solving limited memory influence diagrams (Q895537) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)