Graph homomorphisms with complex values: A dichotomy theorem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 275-286

  Cai, Jin Yi ^a   Chen, Xi ^b   Lu, Pinyan ^c  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX VALUES; DICHOTOMY THEOREM; GRAPH HOMOMORPHISMS; GRAPH PROPERTIES; GREENHILL; SYMMETRIC MATRICES; UNDIRECTED GRAPH; VERTEX COVER;

COMPUTATIONAL COMPLEXITY; LINGUISTICS; TRANSLATION (LANGUAGES);

GRAPH THEORY;

EID: 77955326234     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_24     Document Type: Conference Paper

References (22)

1. Dyer, M., Greenhill, C.: The complexity of counting graph homomorphisms. In: Proceedings of the 9th International Conference on Random Structures and Algorithms, pp. 260-289 (2000)
2. Bulatov, A., Grohe, M.: The complexity of partition functions. Theoretical Computer Science 348 (2), 148-186 (2005)
3. Goldberg, L., Grohe, M., Jerrum, M., Thurley, M.: A complexity dichotomy for partition functions with mixed signs. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, pp. 493-504 (2009)
4. Lovász, L.: Operations with structures. Acta Mathematica Hungarica 18, 321-328 (1967)
5. Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)
6. Freedman, M., Lovász, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphism of graphs. Journal of the American Mathematical Society 20, 37-51 (2007)
7. Dyer, M., Goldberg, L., Paterson, M.: On counting homomorphisms to directed acyclic graphs. Journal of the ACM 54 (6) (2007) Article 27
8. Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48 (1), 92-110 (1990)
9. Thurley, M.: The complexity of partition functions on Hermitian matrices. arXiv (1004.0992) (2010)
10. Cai, J. Y., Chen, X., Lu, P.: Graph homomorphisms with complex values: A dichotomy theorem. arXiv (0903.4728) (2009)
11. Schaefer, T.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216-226 (1978)
12. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. In: SIAM Monographs on Discrete Mathematics and Applications (2001)
13. Feder, T., Vardi, M.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28 (1), 57-104 (1999)
14. Valiant, L.: Holographic algorithms. SIAM Journal on Computing 37 (5), 1565-1594 (2008)
15. Valiant, L.: Accidental algorthims. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 509-517 (2006)
16. Cai, J. Y., Lu, P.: Holographic algorithms: from art to science. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 401-410 (2007)
17. Cai, J. Y., Lu, P., Xia, M.: Holant problems and counting CSP. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 715-724 (2009)
18. Feynman, R., Leighton, R., Sands, M.: The Feynman Lectures on Physics. Addison- Wesley, Reading (1970)
19. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (1998)
20. Ko, K.: Complexity Theory of Real Functions. Birkhäuser, Boston (1991)
21. Lovász, L.: The rank of connection matrices and the dimension of graph algebras. European Journal of Combinatorics 27 (6), 962-970 (2006)
22. Lidl, R., Niederreiter, H.: Finite Fields.. Encyclopedia of Mathematics and its Applications, vol. 20. Cambridge University Press, Cambridge (1997)