Skip to main content
SpringerLink
Log in

Holant Problems

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 152 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. Cai JY, Lu P (2011) Holographic algorithms: from art to science. J Comput Syst Sci 77(1):41–61

    Article  MathSciNet  MATH  Google Scholar 

  2. Cai JY, Lu P, Xia M (2010) Holographic algorithms with matchgates capture precisely tractable planar #CSP. In: FOCS, Las Vegas. IEEE Computer Society, pp 427–436

    Google Scholar 

  3. Cai JY, Lu P, Xia M (2011) Computational complexity of Holant problems. SIAM J Comput 40(4):1101–1132

    Article  MathSciNet  MATH  Google Scholar 

  4. Cai JY, Lu P, Xia M (2011) Dichotomy for Holant* problems of Boolean domain. In: SODA, San Francisco. SIAM, pp 1714–1728

    Google Scholar 

  5. Cai JY, Huang S, Lu P (2012) From Holant to #CSP and back: dichotomy for Holantc problems. Algorithmica 64(3):511–533

    Article  MathSciNet  MATH  Google Scholar 

  6. Cai JY, Guo H, Williams T (2013) A complete dichotomy rises from the capture of vanishing signatures (extended abstract). In: STOC, Palo Alto. ACM, pp 635–644

    MATH  Google Scholar 

  7. Cai JY, Lu P, Xia M (2013) Dichotomy for Holant* problems with domain size 3. In: SODA, New Orleans. SIAM, pp 1278–1295

    Google Scholar 

  8. Cai JY, Guo H, Williams T (2014) The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems. In: FOCS, Philadelphia. IEEE, pp 601–610

    Google Scholar 

  9. Guo H, Lu P, Valiant LG (2013) The complexity of symmetric Boolean parity Holant problems. SIAM J Comput 42(1):324–356

    Article  MathSciNet  MATH  Google Scholar 

  10. Huang S, Lu P (2012) A dichotomy for real weighted Holant problems. In: CCC, Porto. IEEE Computer Society, pp 96–106

    Google Scholar 

  11. Valiant LG (2006) Accidental algorithms. In: FOCS, Berkeley. IEEE, pp 509–517

    Google Scholar 

  12. Valiant LG (2008) Holographic algorithms. SIAM J Comput 37(5):1565–1594

    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

    Heng Guo

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

    Tyson Williams

Authors
  1. Jin-Yi Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heng Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tyson Williams
    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., Guo, H., Williams, T. (2016). Holant Problems. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_748

Download citation

Publish with us

Policies and ethics

Search

Navigation