Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of minimal satisfiability problems
Information and Computation
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
Parameterized complexity of constraint satisfaction problems
Computational Complexity
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Algorithmica - Special Issue: Matching Under Preferences; Guest Editors: David F. Manlove, Robert W. Irving and Kazuo Iwama
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
Searching the k-change neighborhood for TSP is W[1]-hard
Operations Research Letters
Stable assignment with couples: Parameterized complexity and local search
Discrete Optimization
Parameterized Complexity
The parameterized complexity of local search for TSP, more refined
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Parameterized complexity results for exact bayesian network structure learning
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We study the complexity of local search for the Boolean constraint satisfaction problem (CSP), in the following form: given a CSP instance, that is, a collection of constraints, and a solution to it, the question is whether there is a better (lighter, i.e., having strictly less Hamming weight) solution within a given distance from the initial solution. We classify the complexity, both classical and parameterized, of such problems by a Schaefer-style dichotomy result, that is, with a restricted set of allowed types of constraints. Our results show that there is a considerable amount of such problems that are NP-hard, but fixed-parameter tractable when parameterized by the distance.