The complexity of Boolean constraint satisfaction local search problems

Annals of Mathematics and Artificial Intelligence

Volumn 43, Issue 1-4, 2005, Pages 51-63

  Chapdelaine, Philippe ^a   Creignou, Nadia ^b  

^a UNIVERSITÉ DE CAEN   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

complexity; local search; optimization; PLS; PLS complete; satisfiability

Indexed keywords

EID: 10344221618     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-0419-3     Document Type: Article

References (24)

1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, in: Proceedings of 33rd IEEE Symp. on the Foundations of Computer Science (1992) pp. 14-23.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi, Complexity and Approximation (Springer, 1999).
3. M. Bellare, O. Goldreich and M. Sudan, Free bits, PCPs, and nonapproximability - towards tight results, SIAM Journal on Computing 27(3) (1998) 804-915.
4. L. Bole and J. Cytowski, Search Methods for Artificial Intelligence (Academic Press, 1992).
5. N. Creignou, A dichotomy theorem for maximum generalized satisfiability problems, Journal of Computer and System Sciences 51(3) (1995) 511-522.
6. N. Creignou and M. Hermann, Complexity of generalized satisfiability counting problems, Information and Computation 125(1) (1996) 1-12.
7. N. Creignou, S. Khanna and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monographs on Discrete Mathematics and Applications (2001).
8. P. Crescenzi, R. Silvestri and L. Trevisan, To weight or not to weight: Where is the question?, in: Proceedings of the 4th IEEE Israel Symposium on Theory of Computing and Systems (1996) pp. 68-77.
9. n algorithm for k-SAT based on local search, Theoretical Computer Science (2002).
10. J. Gu, P. Purdom, J. Franco and B.W. Wah, Algorithms for the Satisfiability Problem, Cambridge Tracts in Theoretical Computer Science, Vol. 51 (Cambridge University Press, Cambridge, MA, 2000).
11. E.A. Hirsch, SAT local search algorithms: worst-case study, Journal of Automated Reasoning 24(1/2) (2000) 127-143.
12. H.B. Hunt III, R.E. Stearns and M. V. Marathe, Relational representability, local reductions, and the complexity of generalized satisfiability problems, Manuscript (2000).
13. D.S. Johnson, C.H. Papadimitriou and M. Yannakakis, How easy is local search? Journal of Computer and System Sciences 37 (1988) 79-100.
14. S. Khanna and M. Sudan, The optimization complexity of constraint satisfaction problems, Stanford University Tech. Note STAN-CS-TN-96-29 (1996).
15. S. Khanna, M. Sudan, L. Trevisan and D.P. Williamson, The approximability of constraint satisfaction problems, SIAM Journal on Computing 30(6) (2000) 1863-1920.
16. E. Koutsoupias and C.H. Papadimitriou, On the greedy algorithm for Satisfiability, Information Processing Letters 43(1) (1992) 53-55.
17. M.W. Krentel, On finding and verifying locally optimal solutions, SIAM Journal on Computing 19(4) (1990) 742-749.
18. C.H. Papadimitriou, On selecting a satisfying truth assignment, in: Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (1991) pp. 163-169.
19. S. Reith and H. Vollmer, Optimal satisfiability for propositional calculi and constraint satisfaction problems, in: Proceedings of 25th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 1893 (Springer, 2000) pp. 640-649.
20. T.J. Schaefer, The complexity of satisfiability problems, in: Conference Record of the 10th Annual ACM Symposium on Theory of Computing, San Diego, CA (1-3 May 1978) pp. 216-226.
21. A.A. Schäffer and M. Yannakakis, Simple local search problems that are hard to solve, SIAM Journal on Computing 20(1) (1991) 56-87.
22. U. Schöning, A probabilistic algorithm for k-SAT and constraint satisfaction problems, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS'99 (1999) pp. 410-414.
23. B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of the 10th National Conference on Artificial Intelligence, AAAI'92 (MIT Press, 1992) pp. 440-446.
24. E. Trevisan, G.B. Sorkin, M. Sudan and D.P. Williamson, Gadgets, approximation, and linear programming, SIAM Journal on Computing 29(6) (2000) 2074-2097.