Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On finding and verifying locally optimal solutions
SIAM Journal on Computing
Simple local search problems that are hard to solve
SIAM Journal on Computing
On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the greedy algorithm for satisfiability
Information Processing Letters
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Complexity of generalized satisfiability counting problems
Information and Computation
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Gadgets, Approximation, and Linear Programming
SIAM Journal on Computing
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the hardness of losing weight
ACM Transactions on Algorithms (TALG)
On the PLS-complexity of maximum constraint assignment
Theoretical Computer Science
| Hi-index | 0.00 |
The class of generalized satisfiability problems, first introduced by Schaefer in 1978, presents a uniform way of studying the complexity of Boolean constraint satisfaction problems with respect to the nature of constraints allowed in the input. We investigate the complexity of local search for this class of problems. We prove a dichotomy result: any generalized satisfiability local search problem is either in P or PLS-complete. In the meantime our study contributes to a better understanding of the complexity class PLS through the identification of an appropriate tool that captures reducibility among Boolean constraint satisfaction local search problems: sensitive implementation.