A simplified NP-complete MAXSAT problem
Information Processing Letters
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
On Local Search and Placement of Meters in Networks
SIAM Journal on Computing
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Proof Complexity
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
On the Hardness of Losing Weight
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
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
On problems without polynomial kernels
Journal of Computer and System Sciences
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Stable Assignment with Couples: Parameterized Complexity and Local Search
Parameterized and Exact Computation
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
Searching the k-change neighborhood for TSP is W[1]-hard
Operations Research Letters
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
Towards tractable Boolean games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Minimizing rosenthal potential in multicast games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Parameterized complexity results for exact bayesian network structure learning
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Sat and Max Sat are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the number of clauses satisfied by a given truth assignment by flipping the truth values of at most k variables (k-flip local search). For a total number of n variables the size of the search space is of order n^k and grows quickly in k; hence most practical algorithms use 1-flip local search only. In this paper we investigate the worst-case complexity of k-flip local search, considering k as a parameter: is it possible to search significantly faster than the trivial n^k bound? In addition to the unbounded case we consider instances with a bounded number of literals per clause and instances where each variable occurs in a bounded number of clauses. We also consider the related problem that asks whether we can satisfy all clauses by flipping the truth values of at most k variables.