Towards a dichotomy theorem for the counting constraint satisfaction problem

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 562-571

  Bulatov, Andrei A ^a   Dalmau, Víctor ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; EQUIVALENCE CLASSES; GRAPH THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; TIME DOMAIN ANALYSIS;

COUNTING CONSTRAINT SATISFACTION PROBLEM; COUNTING GRAPH HOMOMORPHISMS; DICHOTOMY THEOREM; MALTSEV POLYMORPHISM;

COMPUTATIONAL COMPLEXITY;

EID: 0344550477     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (51)

1. J. Bang-Jensen and P. Hell. The effect of two cycles on the complexity of colourings by directed graphs. Discrete Applied Math., 26(1):1-23 (1990).
2. J. Bang-Jensen, P. Hell, and G. MacGillivray. Hereditarily hard H-coloring problems. Discrete Math., 138:75-92, 1995.
3. G. Brightwell and P. Winkler. Graph homomorphisms and phase transitions. Journal of Combinatorial Theory, Ser. B, 77:221-262, 1999.
4. R. Bubley, M. Dyer, C. Greenhill, and M. Jerrum. On approximately counting colourings of small degree graphs. SIAM Journal of Computing, 29:387-400, 1999.
5. A. Bulatov. Three-element Mal'tsev algebras. Acta Sci. Math (Szeged). To appear.
6. A. Bulatov. Mal'tsev constraints are tractable. Technical Report PRG-RR-02-05, Computing Laboratory, University of Oxford, Oxford, UK, 2002.
7. A. Bulatov and V. Dalmau. Towards a dichotomy theorem for the counting constraint satisfaction problem. Technical Report PRG-RR-03-13, Computing Laboratory, University of Oxford, Oxford, UK, 2003
8. A. Bulatov and P. Jeavons. Algebraic approach to multisorted constraints. Technical Report PRG-RR-01-18, Computing Laboratory, University of Oxford, Oxford, UK, 2001.
9. A. Bulatov and P. Jeavons. Algebraic structures in combinatorial problems. Technical Report MATH-AL-4-2001, Technische universitaẗt Dresden, Dresden, Germany, 2001.
10. A. Bulatov, A. Krokhin, and P. Jeavons. Constraint satisfaction problems and finite algebras. In Proceedings of 27th International Colloquium on Automata, Languages and Programming - ICALP'00, volume 1853 of Lecture Notes in Computer Science, pages 272-282. Springer-Verlag, 2000.
11. R. Burton and J. Steif. Nonuniqueness of measures of maximal entropy for subshifts of finite type. Ergodic Theory and Dynamical Systems, 14:213-236, 1994.
12. P. Cohn, Universal Algebra. Harper & Row, 1965.
13. N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Information and Computation, 125(1):1-12, 1996.
14. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems, volume 7 of SIAM Monographs on Discrete Mathematics and Applications. SIAM, 2001.
15. V. Dalmau. A new tractable class of constraint satisfaction problems. In Proceedings 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
16. J. Diaz, M. Serna, and D. Thilikos. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, DIMACS/DIMATIA Workshop on Graphs, Morphism and Statistical Physics. American Mathematical Society, chapter Recent results on parameterized H-coloring. To appear.
17. J. Diaz, M. Serna, and D. Thilikos. The complexity of restrictive H-coloring. To appear in Discrete Applied Mathematics.
18. J. Diaz, M. Serna, and D. Thilikos. Counting list H-colorings and variants. Technical Report LSI-01-27-R, Departament LSI, Universitat Politècnica de Catalunya, 2001.
19. J. Diaz, M. Serna, and D. Thilikos, Counting h-colorings of partial k-trees. Theoretical Computer Science, 281:291-309, 2002.
20. M. Dyer and C. Greenhill. The complexity of counting graph homomorphisms. Random Structures and Algorithms, 17:260-289, 2000.
21. T. Feder, Constraint satisfaction on finite groups with near subgroups. Submitted to Journal of Algebra.
22. T. Feder and M. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal of Computing, 28:57-104, 1998.
23. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA., 1979.
24. C. Greenhill. The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity, 9:52-73, 2000.
25. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 657-666, Hersonissos, Crete, Greece, July 2001. ACM Press.
26. P. Hell and J. Neštřil. Counting list homomorphisms for graphs with bounded degrees. Discrete Mathematics. to appear.
27. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Ser. B, 48:92-110, 1990.
28. P. Hell, J. Nešetřil, and X. Xhu. Duality and polynomial testing of tree homomorphisms. Trans. of the AMS, 348(4):1281-1297, 1996.
29. D. Hobby, and R. McKenzie. The Structure of Finite Algebras, volume 76 of Contemporary Mathematics. American Mathematical Society, Providence, R. I., 1988.
30. H. Hunt III, M. Marathe, V. Radhakrishnan, and R. Stearns. The complexity of planar counting problems. SIAM Journal on Computing, 27:1142-1167, 1998.
31. P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
32. P. Jeavons, D. Cohen, and M. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1-2):251-265, 1998.
33. P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
34. P. Kolaitis and M. Vardi. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci., 61:302-332, 2000.
35. J. Lebowitz and G. Gallavotti. Phase transitions in binary lattice gases. Journal of Math. Physics, 12:1129-1133, 1971.
36. L. Levin. Universal enumeration problems. Problems on Information Transmission, 9:265-266, 1973.
37. N. Linial. Had enumeration problems in geometry and combinatorics. SIAM Journal on Algebraic and Discrete Methods, 7(2):331-335, 1986.
38. R. McKenzie, G. McNulty, and W. Taylor. Algebras, Lattices and Varieties, volume I. Wadsworth and Brooks, California, 1987.
39. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7:95-132, 1974.
40. P. Orponen. Dempster's rule of combination is #-complete. Artificial Intelligence, 44:245-253, 1990.
41. N. Pippenger. Theories of Computability. Cambridge University Press, Cambridge, 1997.
42. R. Pöschel. Galois connection for operations and relations. Technical Report MATH-AL-8-2001, Technische Universität Dresden, Germany, 2001.
43. R. Pöschel and L. Kalužnin. Funktionen- und Relationenalgebren. DVW, Berlin, 1979.
44. E. Post. The two-valued iterative systems of mathematical logic, volume 5 of Annals Mathematical Studies. Princeton University Press, 1941.
45. J. Provan and M. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal of Computing, 12(4):777-788, 1983.
46. D. Roth. On the hardness of approximate reasoning. Artificial Intelligence, 82:273-302, 1996.
47. T. Schaefer. The complexity of satisfiability problems. In Proceedings 10th ACM Symposium on Theory of Computing (STOC'78), pages 216-226, 1978.
48. A. Szendrei. Clones in Universal Algebra, volume 99 of Seminaires de Mathematiques Superieures. Université de Móntreal, 1986.
49. L. Valiant. The complexity of computing the permanent. Theoretical Computing Science, 8:189-201, 1979.
50. L. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
51. X. Zhu. A polynomial algorithm for homomorphisms to oriented cycles. Journal of Algorithms, 19:333-345, 1995.