The complexity of the counting constraint satisfaction problem

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 646-661

  Bulatov, Andrei A ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER OPERATING PROCEDURES; LINGUISTICS; POLYNOMIAL APPROXIMATION; STEELMAKING; TRANSLATION (LANGUAGES);

#P-COMPLETE; CONSTRAINT SATISFACTION PROBLEM; POLYNOMIAL-TIME; RELATIONAL STRUCTURES;

AUTOMATA THEORY;

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

References (31)

1. Brightwell, G.R., Winkler, P.: Graph homomorphisms and phase transitions. J. of Comb. Th., Ser. B 77, 221-262 (1999)
2. Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: FOCS 2002, pp. 649-658 (2002)
3. Bulatov, A.A.: Tractable conservative constraint satisfaction problems. In: LICS 2003, Ottawa, pp. 321-330 (2003)
4. Bulatov, A.A., Jeavons, P.G.: An algebraic approach to multi-sorted constraits. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 197-202. Springer, Heidelberg (2003)
5. Bulatov, A.A.: Three-element Mal'tsev algebras. Acta Sci. Math. (Szeged) 72, 519-550 (2006)
6. Bulatov, A.A.: The complexity of the counting constraint satisfaction problem. ECCC TR07-093 (2007)
7. Bulatov, A.A., Dalmau, V.: A simple algorithm for Mal'tsev constraints. SIAM J. Comput. 36(1), 16-27 (2006)
8. Bulatov, A.A., Dalmau, V.: Towards a dichotomy theorem for the counting constraint satisfaction problem. Information and Computation 205(5), 651-678 (2007)
9. Bulatov, A.A., Grohe, M.: The complexity of partition functions. Theor. Comput. Sci. 348(2-3), 148-186 (2005)
10. Burris, S., Sankappanavar, H.P.: A course in universal algebra. Graduate Texts in Mathematics, vol. 78. Springer, New York (1981)
11. Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Information and Computation 125(1), 1-12 (1996)
12. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7. SIAM, Philadelphia (2001)
13. Diaz, J., Serna, M., Thilikos, D.M.: Recent results on parameterized H-coloring. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, DIMACS/DIMATIA Workshop on Graphs, Morphism and Statistical Physics. American Mathematical Society (to appear)
14. Diaz, J., Serna, M., Thilikos, D.M.: Complexity issues on bounded restrictive H-coloring. Discrete Mathematics 307(16), 2082-2093 (2007)
15. Diaz, J., Serna, M., Thilikos, D.M.: Counting list H-colorings and variants. Technical Report LSI-01-27-R, Departament LSI, Universitat Politècnica de Catalunya (2001)
16. Diaz, J., Serna, M., Thilikos, D.M.: Counting h-colorings of partial k-trees. Theor. Comput. Sci. 281, 291-309 (2002)
17. Dyer, M., Frieze, A., Jerrum, M.: On counting independent sets in sparse graphs. SIAM J. Comput. 31, 1527-1541 (2002)
18. Dyer, M., Goldberg, L., Paterson, M.: On counting homomorphisms to directed acyclic graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 38-49. Springer, Heidelberg (2006)
19. Dyer, M., Goldberg, L.A., Greenhill, C., Jerrum, M.: On the relative complexity of approximate counting problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 108-119. Springer, Heidelberg (2000)
20. Dyer, M., Greenhill, C.: The complexity of counting graph homomorphisms. Random Structures and Algorithms 17, 260-289 (2000)
21. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28, 57-104 (1998)
22. Freese, R., McKenzie, R.: Commutator theory for congruence modular varieties. London Math. Soc. Lecture Notes, vol. 125. London (1987)
23. Gratzer, G.: General Lattice Theory. Birkhäuser Verlag, Basel (1998)
24. Greenhill, C.: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity 9, 52-73 (2000)
25. Hell, P., Nešetřil, J.: Counting list homomorphisms for graphs with bounded degrees. Discr. Math. (to appear)
26. Hobby, D., McKenzie, R.N.: The Structure of Finite Algebras. Contemporary Mathematics, vol. 76. American Mathematical Society, Providence (1988)
27. Jeavons, P.G.: On the algebraic structure of combinatorial problems. Theor. Comput. Sci. 200, 185-204 (1998)
28. Jeavons, P.G., Cohen, D.A., Gyssens, M.: How to determine the expressive power of constraints. Constraints 4, 113-131 (1999)
29. Schaefer, T.J.: The complexity of satisfiability problems. In: STOC 1978, pp. 216-226 (1978)
30. Vadhan, S.P.: The complexity of counting in sparse, regular and planar graphs. SIAM J. Comput. 31(2), 398-427 (2001)
31. Valiant, L.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189-201 (1979)