R. Bubley and M. Dyer, Graph orientations with no sink and an approximation for a hard case of #SAT, 8th ACM?SIAM Symp. on Discrete Algorithms, pp.248-257, 1997.

A. A. Bulatov, A dichotomy theorem for constraint satisfaction problems on a 3-element set, Journal of the ACM, vol.53, issue.1, pp.66-120, 2006.
DOI : 10.1145/1120582.1120584

A. A. Bulatov, The complexity of the counting constraint satisfaction problem, 35th Intl Colloq. on Automata, Languages and Programming (ICALP 2008) Part I, pp.646-661, 2008.

J. Cai, P. Lu, and M. Xia, The complexity of complex weighted Boolean #CSP. Upcoming journal submission, 2009.

N. Creignou and M. Hermann, Complexity of Generalized Satisfiability Counting Problems, Information and Computation, vol.125, issue.1, pp.1-12, 1996.
DOI : 10.1006/inco.1996.0016

V. Dalmau and D. K. Ford, Generalized Satisfiability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity, Math. Founds of Comput. Sci, pp.358-367, 2003.
DOI : 10.1007/978-3-540-45138-9_30

M. Dyer, A. Frieze, and M. Jerrum, On Counting Independent Sets in Sparse Graphs, SIAM Journal on Computing, vol.31, issue.5, pp.1527-1541, 2002.
DOI : 10.1137/S0097539701383844

M. Dyer, L. A. Goldberg, C. S. Greenhill, and M. Jerrum, The Relative Complexity of Approximate Counting Problems, Algorithmica, vol.38, issue.3, pp.471-500, 2003.
DOI : 10.1007/s00453-003-1073-y

M. Dyer, L. A. Goldberg, and M. Jerrum, An approximation trichotomy for Boolean #CSP, Journal of Computer and System Sciences, vol.76, issue.3-4, 2007.
DOI : 10.1016/j.jcss.2009.08.003

M. Dyer, L. A. Goldberg, and M. Jerrum, The Complexity of Weighted Boolean CSP, SIAM Journal on Computing, vol.38, issue.5, pp.1970-1986, 2009.
DOI : 10.1137/070690201

M. Dyer and C. S. , On Markov Chains for Independent Sets, Journal of Algorithms, vol.35, issue.1, pp.17-49, 2000.
DOI : 10.1006/jagm.1999.1071

R. Fagin, L. J. Stockmeyer, and M. Y. Vardi, On monadic NP vs. monadic co-NP, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, pp.78-92, 1995.
DOI : 10.1109/SCT.1993.336544

T. Feder, Fanout limitations on constraint systems, Theoretical Computer Science, vol.255, issue.1-2, pp.281-293, 2001.
DOI : 10.1016/S0304-3975(99)00288-1

T. Feder and M. Y. Vardi, The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory, SIAM Journal on Computing, vol.28, issue.1, pp.57-104, 1998.
DOI : 10.1137/S0097539794266766

E. C. Freuder, Complexity of k-tree structured constraint satisfaction problems, 8th Conf. of American Assoc. for Art. Intelligence, pp.4-9, 1990.

P. Hell and J. Ne?et?il, On the complexity of H-coloring, Journal of Combinatorial Theory, Series B, vol.48, issue.1, pp.92-110, 1990.
DOI : 10.1016/0095-8956(90)90132-J

P. Hell and J. Ne?et?il, Graphs and Homomorphisms, 2004.
DOI : 10.1093/acprof:oso/9780198528173.001.0001

M. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science, vol.43, pp.169-188, 1986.
DOI : 10.1016/0304-3975(86)90174-X

D. E. Knuth, The Art of Computer Programming Combinatorial Algorithms

. G. Ph, M. Y. Kolaitis, and . Vardi, Conjunctive query containment and constraint satisfaction, J. Comput. Sys. Sci, vol.61, issue.2, pp.302-332, 2000.

. G. Ph, M. Y. Kolaitis, and . Vardi, A game-theoretic approach to constraint satisfaction, 17th Conf. of American Assoc. for Artif. Intelligence, pp.175-181, 2000.

V. Kumar, Algorithms for constraint satisfaction problems: A survey, pp.33-42, 1992.

R. E. Ladner, On the Structure of Polynomial Time Reducibility, Journal of the ACM, vol.22, issue.1, pp.155-171, 1975.
DOI : 10.1145/321864.321877

M. Luby and E. Vigoda, Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures and Algorithms, pp.3-4229, 1999.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-135, 1974.
DOI : 10.1016/0020-0255(74)90008-5

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350

S. Toda, On the computational power of PP and (+)P, 30th Annual Symposium on Foundations of Computer Science
DOI : 10.1109/SFCS.1989.63527

L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-201, 1979.
DOI : 10.1016/0304-3975(79)90044-6

L. G. Valiant, The Complexity of Enumeration and Reliability Problems, SIAM Journal on Computing, vol.8, issue.3, pp.410-421, 1979.
DOI : 10.1137/0208032

D. Weitz, Counting independent sets up to the tree threshold, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.140-149, 2006.
DOI : 10.1145/1132516.1132538

D. Welsh, Complexity: Knots, Colourings and Counting, 1993.
DOI : 10.1017/CBO9780511752506