On the hardness of losing weight

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 662-673

  Krokhin, Andrei ^a   Marx, Dániel ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER OPERATING PROCEDURES; LINGUISTICS; NUCLEAR PROPULSION; TRANSLATION (LANGUAGES);

BOOLEAN CONSTRAINTS; HAMMING WEIGHTS; INITIAL SOLUTION; LOCAL SEARCH; NP-HARD; PARAMETERIZED;

AUTOMATA THEORY;

EID: 49049116940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_54     Document Type: Conference Paper

References (15)

1. Chapdelaine, P., Creignou, N.: The complexity of Boolean constraint satisfaction local search problems. Annals of Mathematics and Artificial Intelligence 43, 51-63 (2005)
2. Cohen, D., Jeavons, P.: The complexity of constraint languages. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch. 8. Elsevier, Amsterdam (2006)
3. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7 (2001)
4. Crescenzi, P., Rossi, G.: On the Hamming distance of constraint satisfaction problems. Theoretical Computer Science 288(1), 85-100 (2002)
5. n algorithm for k-SAT based on local search. Theoretical Computer Science 289, 69-83 (2002)
6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
7. Fellows, M.R.: Parameterized complexity: new developments and research frontiers. In: Aspects of Complexity (Kaikura, 2000). de Gruyter Series in Logic and Applications, vol. 4, pp. 51-72 (2001)
8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
9. Gu, J., Purdom, P., Franko, J., Wah, B.W.: Algorithms for the Satisfiability Problem. Cambridge University Press, Cambridge (2000)
10. Hirsch, E.: SAT local search algorithms: worst-case study. Journal of Automated Reasoning 24, 127-143 (2000)
11. Hoos, H., Tsang, E.: Local search methods. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. ch. 5. Elsevier, Amsterdam (2006)
12. Kirousis, L., Kolaitis, P.: The complexity of minimal satisfiability problems. Information and Computation 187, 20-39 (2003)
13. Marx, D.: Parameterized complexity of constraint satisfaction problems. Computational Complexity 14, 153-183 (2005)
14. Marx, D.: Searching the k-change neighborhood for TSP is W[1]-hard. Operations Research Letters 36, 31-36 (2008)
15. Schaefer, T.J.: The complexity of satisfiability problems. In: STOC 1978, pp. 216-226 (1978)