Skip to main content
SpringerLink
Log in

Complexity Dichotomies for Counting Graph Homomorphisms

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 67 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Bulatov A, Grohe M (2005) The complexity of partition functions. Theor Comput Sci 348(2):148–186

    Article  MathSciNet  MATH  Google Scholar 

  2. Cai JY, Chen X, Lu P (2013) Graph homomorphisms with complex values: a dichotomy theorem. SIAM J Comput 42(3):924–1029

    Article  MathSciNet  MATH  Google Scholar 

  3. Carlitz L (1969) Kloosterman sums and finite field extensions. Acta Arith 16:179–193

    MathSciNet  MATH  Google Scholar 

  4. Creignou N, Khanna S, Sudan M (2001) Complexity classifications of boolean constraint satisfaction problems. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, Philadelphia

    Book  MATH  Google Scholar 

  5. Dyer M, Greenhill C (2000) The complexity of counting graph homomorphisms. Random Struct Algorithms 17(3–4):260–289

    Article  MathSciNet  MATH  Google Scholar 

  6. Freedman M, Lovász L, Schrijver A (2007) Reflection positivity, rank connectivity, and homomorphism of graphs. J Am Math Soc 20:37–51

    Article  MathSciNet  MATH  Google Scholar 

  7. Goldberg L, Grohe M, Jerrum M, Thurley M (2010) A complexity dichotomy for partition functions with mixed signs. SIAM J Comput 39(7):3336–3402

    Article  MathSciNet  MATH  Google Scholar 

  8. Grohe M, Thurley M (2011) Counting homomorphisms and partition functions. In: Grohe M, Makowsky J (eds) Model theoretic methods in finite combinatorics. Contemporary mathematics, vol 558. American Mathematical Society, Providence

    Google Scholar 

  9. Hell P, Nešetřil J (1990) On the complexity of H-coloring. J Comb Theory Ser B 48(1):92–110

    Article  MathSciNet  MATH  Google Scholar 

  10. Ladner R (1975) On the structure of polynomial time reducibility. J ACM 22(1):155–171

    Article  MathSciNet  MATH  Google Scholar 

  11. Lidl R, Niederreiter H (1997) Finite fields. Encyclopedia of mathematics and its applications, vol 20. Cambridge University Press, Cambridge

    Google Scholar 

  12. Linial N (1986) Hard enumeration problems in geometry and combinatorics. SIAM J Algebraic Discret Methods 7:331–335

    Article  MathSciNet  MATH  Google Scholar 

  13. Schaefer T (1978) The complexity of satisfiability problems. In: Proceedings of the 10th annual ACM symposium on theory of computing, San Diego, California, pp 216–226

    Google Scholar 

  14. Vadhan S (2002) The complexity of counting in sparse, regular, and planar graphs. SIAM J Comput 31:398–427

    Article  MathSciNet  MATH  Google Scholar 

  15. Valiant L (1979) The complexity of computing the permanent. Theor Comput Sci 8:189–201

    Article  MathSciNet  MATH  Google Scholar 

  16. Valiant L (1979) The complexity of enumeration and reliability problems. SIAM J Comput 8:410–421

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beijing University, Beijing, China

    Jin-Yi Cai

  2. Computer Sciences Department, University of Wisconsin–Madison, Madison, WI, USA

    Jin-Yi Cai

  3. Computer Science Department, Columbia University, New York, NY, USA

    Xi Chen

  4. Computer Science and Technology, Tsinghua University, Beijing, China

    Xi Chen

  5. Microsoft Research Asia, Shanghai, China

    Pinyan Lu

Authors
  1. Jin-Yi Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pinyan Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jin-Yi Cai .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Cai, JY., Chen, X., Lu, P. (2016). Complexity Dichotomies for Counting Graph Homomorphisms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_747

Download citation

Publish with us

Policies and ethics

Search

Navigation