Algorithms for the MAXIMUM HAMMING DISTANCE problem

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

Volumn 3419 LNAI, Issue , 2005, Pages 128-141

  Angelsmark, Ola ^a   Thapper, Johan ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LOGIC PROGRAMMING; MICROSTRUCTURE;

CONSTRAINT SATISFACTION PROBLEMS; MAX HAMMING PROBLEMS; RUNNING TIME;

PROBLEM SOLVING;

EID: 26844501279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11402763_10     Document Type: Conference Paper

References (11)

1. O. Angelsmark and J. Thapper. Microstructure based algorithms for three constraint satisfaction optimisation problems, 2004. Unpublished manuscript. Available for download at http://www.ida.liu.se/~olaan/papers/three-algorithms.ps.
2. B. Aspvall, M. F. Plass, and R. E. Tarjan. A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters, 8(3):121-123, Mar. 1979.
3. P. Crescenzi and G. Rossi. On the Hamming distance of constraint satisfaction problems. Theoretical Computer Science, 288(1):85-100, October 2002.
4. V. Dahllöf, P. Jonsson, and M. Wahlström. On counting models for 2SAT and 3SAT formulae, 2003. Unpublished manuscript. Available for download at http://www.ida.liu.se/~magwa/research/merge23sat.ps.
5. D. Eppstein. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA-2001), pages 329-337, 2001.
6. T. Feder and R. Motwani. Worst-case time bounds for coloring and satisfiability problems. Journal of Algorithms, 45(2):192-201, Nov. 2002.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
8. T. Hofmeister, U. Schöning, R. Schuler, and O. Watanabe. A probabilistic 3-SAT algorithm further improved. In H. Alt and A. Ferriera, editors, Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS-2002), pages 192-202, Antibes Juan-les-Pins, France, 2002. Springer-Verlag, Berlin, Heidelberg.
9. P. Jégou. Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In Proceedings of the 11th (US) National Conference on Artificial Intelligence (AAAI-93), pages 731-736, Washington DC, USA, July 1993. AAAI.
10. O. Kullman. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223(1-2): 1-72, 1999.
11. U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In 40th Annual Symposium on Foundations of Computer Science (FOCS-1999), pages 410-414. IEEE Computer Society, 1999.