The complexity of weighted Boolean #CSP

SIAM Journal on Computing

Volumn 38, Issue 5, 2008, Pages 1970-1986

  Dyer, Martin ^a   Goldberg, Leslie Ann ^b   Jerrum, Mark ^c  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

P; Complexity theory; Constraint satisfaction; Counting

Indexed keywords

BOOLEAN CONSTRAINT; COMPLEXITY THEORY; CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION PROBLEMS; COUNTING; DICHOTOMY THEOREM; FEASIBLE SOLUTION; FINITE SET; NONNEGATIVE FUNCTIONS; PARAMETERIZED; PARTITION FUNCTIONS; PROBLEM INSTANCES; PRODUCT TYPES;

CONSTRAINT THEORY;

THEOREM PROVING;

EID: 68249117534     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070690201     Document Type: Article

References (22)

1. G. Brightwell and P. Winkler, Graph homomorphisms and phase transitions, J. Combin. Theory Ser. B, 77 (1999), pp. 221-262.
2. A. Bulatov and V. Dalmau, Towards a dichotomy theorem for the counting constraint satisfaction problem, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 2003, pp. 562-573.
3. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, The complexity of soft constraint satisfaction, Artificial Intelligence, 170 (2006), pp. 983-1016. (Pubitemid 44037535)
4. A. Bulatov and M. Grohe, The complexity of partition functions, Theoret. Comput. Sci., 348 (2005), pp. 148-186.
5. B. Cipra, An introduction to the Ising model, Amer. Math. Monthly, 94 (1987), pp. 937-959.
6. N. Creignou and M. Hermann, Complexity of generalized satisfiability counting problems, Inform. and Comput., 125 (1996), pp. 1-12. (Pubitemid 126411848)
7. N. Creignou, S. Khanna, and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monogr. Discrete Math. Appl. 7, SIAM, Philadelphia, 2001.
8. M. Dyer and C. Greenhill, The complexity of counting graph homomorphisms, Random Structures Algorithms, 17 (2000), pp. 260-289.
9. M. Dyer, L. A. Goldberg, and M. Paterson, On counting homomorphisms to directed acyclic graphs, in Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 4051, Springer, New York, 2006, pp. 38-49. (Pubitemid 44113287)
10. T. Feder and M. Y. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104. (Pubitemid 128491791)
11. L. A. Goldberg and M. Jerrum, Inapproximability of the Tutte polynomial, Inform. Comput., 206 (2008), pp. 908-929.
12. C. Greenhill, The complexity of counting colourings and independent sets in sparse graphs and hypergraphs, Comput. Complexity, 9 (2000), pp. 52-72.
13. P. Hell and J. Nešetřil, Graphs and Homomorphisms, Oxford University Press, London, 2004.
14. L. Lovász, Operations with structures, Acta Math. Hungarica, 18 (1967), pp. 321-328.
15. R. Ladner, On the structure of polynomial time reducibility, J. ACM, 22 (1975), pp. 155-171.
16. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
17. F. Rossi, P. van Beek, and T. Walsh, eds., Handbook of Constraint Programming, Elsevier, New York, 2006.
18. T. Schaefer, The complexity of satisfiability problems, in Proceedings of the 10th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1978, pp. 216-226.
19. A. Scott and G. Sorkin, Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems, online at http://arxiv.org/abs/cs/0604079.
20. J. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM, 27 (1980), pp. 701-717.
21. L. G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979), pp. 410-421.
22. D. Welsh, Complexity: Knots, Colourings and Counting, LMS Lecture Note Ser. 186, Cambridge University Press, Cambridge, UK, 1993.