L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and real computation, 1998.
DOI : 10.1007/978-1-4612-0701-6

A. Bulatov and M. Grohe, The complexity of partition functions, Theoretical Computer Science, vol.348, issue.2-3, pp.148-186, 2005.
DOI : 10.1016/j.tcs.2005.09.011

J. Cai, X. Chen, and P. Lu, Graph homomorphisms with complex values: a dichotomy theorem, p.4728, 2009.

J. Cai and P. Lu, Holographic algorithms, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.401-410, 2007.
DOI : 10.1145/1250790.1250850

J. Cai, P. Lu, and M. Xia, Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.644-653, 2008.
DOI : 10.1109/FOCS.2008.34

J. Cai, P. Lu, and M. Xia, A computational proof of complexity of some restricted counting problems, TAMC '09: Proceedings of Theory and Applications of Models of Computation, 6th Annual Conference, pp.138-149, 2009.

M. Dyer, L. A. Goldberg, and M. Paterson, On counting homomorphisms to directed acyclic graphs, Journal of the ACM, vol.54, issue.6, 2007.

M. Dyer and C. Greenhill, The complexity of counting graph homomorphisms (extended abstract), SODA '00: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.246-255, 2000.

L. A. Goldberg, M. Grohe, M. Jerrum, and M. Thurley, A Complexity Dichotomy for Partition Functions with Mixed Signs, SIAM Journal on Computing, vol.39, issue.7, 1932.
DOI : 10.1137/090757496
URL : https://hal.archives-ouvertes.fr/inria-00359820

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

M. Kowalczyk and J. Cai, Holant Problems for Regular Graphs with Complex Edge Functions. CoRR, abs/1001, p.464, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455751

S. Vadhan, The Complexity of Counting in Sparse, Regular, and Planar Graphs, SIAM Journal on Computing, vol.31, issue.2, pp.398-427, 2001.
DOI : 10.1137/S0097539797321602

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

L. 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. Valiant, Holographic Algorithms, SIAM Journal on Computing, vol.37, issue.5, pp.1565-1594, 2008.
DOI : 10.1137/070682575

L. Valiant, Quantum Circuits That Can Be Simulated Classically in Polynomial Time, SIAM Journal on Computing, vol.31, issue.4, pp.1229-1254, 2002.
DOI : 10.1137/S0097539700377025

M. Xia, P. Zhang, and W. Zhao, Computational complexity of counting problems on 3-regular planar graphs, Theoretical Computer Science, vol.384, issue.1, pp.111-125, 2007.
DOI : 10.1016/j.tcs.2007.05.023