Skip to main content
SpringerLink
Log in

A Dichotomy for Real Weighted Holant Problems

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

Holant is a framework of counting characterized by local constraints. It is closely related to other well-studied frameworks such as the counting constraint satisfaction problem (#CSP) and graph homomorphism. An effective dichotomy for such frameworks can immediately settle the complexity of all combinatorial problems expressible in that framework. Both #CSP and graph homomorphism can be viewed as subfamilies of Holant with the additional assumption that the equality constraints are always available. Other subfamilies of Holant such as Holant* and Holantc problems, in which we assume some specific sets of constraints to be freely available, were also studied. The Holant framework becomes more expressive and contains more interesting tractable cases with less or no freely available constraint functions, while, on the other hand, it also becomes more challenging to obtain a complete characterization of its time complexity. Recently, a complexity dichotomy for a variety of subfamilies of Holant such as #CSP, graph homomorphism, Holant*, and Holantc for Boolean domain was proved. In this paper, we prove a dichotomy for the general Holant framework where all the constraints are real symmetric functions on Boolean inputs. This setting already captures most of the interesting combinatorial counting problems defined by local constraints, such as (perfect) matching. This is the first time a dichotomy is obtained for general Holant problems without any auxiliary functions. One benefit of working with the Holant framework is some powerful new reduction technique such as the holographic reduction. Along the proof of our dichotomy, we introduce a new reduction technique, namely realizing a constraint function by approximating it. This new technique is employed in our proof in a situation where it seems that all previous reduction techniques fail; thus, this new idea of reduction might also be of independent interest. Besides proving a dichotomy and developing a new technique, we also obtained some interesting by-products. We prove a dichotomy for #CSP, restricting to instances where each variable appears a multiple of d times for any d. We also prove that counting the number of Eulerian orientations on 2k-regular graphs is #P-hard for any \({k \geq 2}\).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  • Lenore Blum, Felipe Cucker, Michael Shub & Steve Smale (1998). Complexity and real computation. Springer-Verlag.

  • Béla Bollobás (1998). Modern graph theory, volume 184 of Graduate Texts in Mathematics. Springer-Verlag.

  • Graham Brightwell & Peter Winkler (2005). Counting Eulerian circuits is #P-Complete. In Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, Vancouver, BC, Canada, 259–262. Society for Industrial and Applied Mathematics.

  • Valentin E. Brimkov & Stefan S. Dantchev (2000). On the com plexity of integer programming in the Blum-Shub-Smale computational model. In Proceedings of Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference 2000, Sendai, Japan, 286–300. Springer-Verlag.

  • Andrei Bulatov, Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius & David Richerby (2009). The complexity of weighted boolean #CSP with mixed signs. Theoretical Computer Science 410, 3949–3961.

  • Bulatov Andrei A. (2006) A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM 53(1): 66–120

    Article  MathSciNet  Google Scholar 

  • Andrei A. Bulatov (2013). The complexity of the counting constraint satisfaction problem. Journal of the ACM 60(5), 34.

  • Andrei A. Bulatov & Víctor Dalmau (2007). Towards a dichotomy theorem for the counting constraint satisfaction problem. Information and Computation 205(5), 651–678.

  • Andrei A. Bulatov & Martin Grohe (2004). The complexity of partition functions. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming ICALP 2004, Turku, Fin land, 294–306. Springer-Verlag.

  • Andrei A. Bulatov & Martin Grohe (2005). The complexity of partition functions. Theoretical Computer Science 348(2–3), 148–186.

  • Jin-Yi Cai, Xi Chen & Pinyan Lu (2011a). Non-negatively weighted #CSP: an effective complexity dichotomy. In Proceedings of the 26th IEEE Conference on Computational Complexity, San Jose, CA, USA, 45–54. IEEE Computer Society Press.

  • Cai Jin-Yi, Chen Xi, Lu Pinyan. (2013) Graph homomorphisms with complex values: a dichotomy theorem. SIAM Journal on Comput 42(3): 924–1029

    Article  MathSciNet  MATH  Google Scholar 

  • Jin-Yi Cai, Heng Guo & Tyson Williams (2013b). A complete dichotomy rises From The capture Of vanishing signatures. In Pro ceedings of the 45th Annual ACM Symposium on Theory of Computing, Palo Alto, CA, USA, 635–644. ACM Press.

  • Cai Jin-Yi, Huang Sangxia, Lu Pinyan. (2012) From Holant to #CSP and back: dichotomy for Holantc problems. Algorithmica 64(3): 511–533

    Article  MathSciNet  MATH  Google Scholar 

  • Jin-Yi Cai & Michael Kowalczyk (2010). A dichotomy for k-regular graphs with {0, 1}-vertex assignments And real edge functions. In Pro ceedings of the 7th Annual Conference on Theory and Applications of Models of Computation, Prague, Czech Republic, 328–339. Springer-Verlag.

  • Jin-Yi Cai, Pinyan Lu & Mingji Xia (2008). Holographic algorithms by Fibonacci gates And holographic reductions for hardness. In Proceed ings of the 49th Annual IEEE Symposium on Foundations of Computer Science, Philadelphia, PA, 644–653. IEEE Computer Society Press.

  • Jin-Yi Cai, Pinyan Lu & Mingji Xia (2009). Holant problems and counting CSP. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, Maryland, USA, 715–724. ACM Press.

  • Jin-Yi Cai, Pinyan Lu & Mingji Xia (2010). Holographic algorithms with matchgates capture precisely tractable planar #CSP. In Proceed ings of the 51st Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, 427–436. IEEE Computer Society Press.

  • Cai Jin-Yi, Lu Pinyan, Xia Mingji. (2011) A computational proof of complexity of some restricted counting problems. Theoretical Computer Science 412(23): 2468–2485

    Article  MathSciNet  MATH  Google Scholar 

  • Jin-Yi Cai, Pinyan Lu & Mingji Xia (2013c). Holographic algo rithms by Fibonacci gates. Linear Algebra and its Applications 438(2), 690–707.

  • Nadia Creignou, Sanjeev Khanna & Madhu Sudan (2001). Com plexity classifications of boolean constraint satisfaction problems. Society for Industrial and Applied Mathematics. ISBN 0-89871-479-6.

  • C. T. J. Dodson & T. Poston (1991). Tensor geometry. Springer- Verlag.

  • Martin E. Dyer, Leslie Ann Goldberg & Mark Jerrum (2009). The complexity of weighted boolean #CSP. SIAM Journal on Com puting 38(5), 1970–1986.

  • Martin E. Dyer, Leslie Ann Goldberg &Mike Paterson (2007). On counting homomorphisms to directed acyclic graphs. Journal of the ACM 54(6).

  • Martin E. Dyer & Catherine S. Greenhill (2000). The com plexity of counting graph homomorphisms (extended abstract). In Pro ceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algo rithms, San Francisco, CA, USA, 246–255. Society for Industrial and Applied Mathematics.

  • Dyer Martin E., Greenhill Catherine S. (2004) Corrigendum: The complexity of counting graph homomorphisms. Random Structures and Algorithms 25(3): 346–352

    Article  MathSciNet  MATH  Google Scholar 

  • Martin E. Dyer & David Richerby (2010). On the complexity of #CSP. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, Cambridge, MA, USA, 725–734. ACM Press.

  • Martin E. Dyer & David Richerby (2011). The #CSP dichotomy is decidable. In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, Dortmund, Germany, 261– 272. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

  • John Faben (2008). The complexity of counting solutions to generalised satisfiability problems modulo k. CoRR abs/0809.1836.

  • Tomás Feder & Moshe Y. Vardi (1998). The computational struc ture of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM Journal on Computing 28(1), 57–104.

  • Ge Qi, Stefankovic Daniel. (2012) The complexity of counting Eulerian tours in 4-regular graphs. Algorithmica 63(3): 588–601

    Article  MathSciNet  MATH  Google Scholar 

  • Leslie Ann Goldberg, Martin Grohe, Mark Jerrum & Marc Thurley (2010). A complexity dichotomy for partition functions with mixed signs. SIAM Journal on Computing 39(7), 3336–3402.

  • Heng Guo, Sangxia Huang, Pinyan Lu & Mingji Xia (2011). The complexity of weighted boolean #CSP modulo k. In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, Dortmund, Germany, 249–260. Schloss Dagstuhl - Leibniz- Zentrum fuer Informatik.

  • Heng Guo, Pinyan Lu & Leslie G. Valiant (2013). The complex ity of symmetric boolean parity Holant problems. SIAM Journal on Computing 42(1), 324–356.

  • Pavol Hell & Jaroslav Nešetřil (1990). On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48(1), 92–110.

  • Sangxia Huang & Pinyan Lu (2012). A dichotomy for real weighted Holant problems. In Proceedings of the 27th IEEE Conference on Com putational Complexity, Porto, Portugal, 96–106. IEEE Computer Soci ety Press.

  • Ising E. (1925) Beitrag zur Theorie des Ferromagnetismus. Zeitschrift für Physik A Hadrons and Nuclei 31(1): 253–258

    Google Scholar 

  • F. Jaeger, D. L. Vertigan & D. J. A. Welsh (1990). On the com putational complexity of the Jones and Tutte polynomials. Proceedings of the Cambridge Philosophical Society 108, 35–53.

  • Ker-I Ko (1991). Complexity theory of real functions. Birkhauser Boston Inc., Cambridge, MA, USA.

  • Michael Kowalczyk & Jin-Yi Cai (2010). Holant problems for reg ular graphs with complex edge functions. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, Nancy, France, 525–536. Schloss Dagstuhl - Leibniz-Zentrum fuer Infor matik.

  • Ladner Richard E. (1975) On the structure of polynomial time reducibility. Journal of the ACM 22(1): 155–171

    Article  MathSciNet  MATH  Google Scholar 

  • Michel Las Vergnas (1988). On the evaluation at (3, 3) of the Tutte polynomial of a graph. Journal of Combinatorial Theory, Series B 45(3), 367–372.

  • H. W. Jr. Lenstra (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research 8(4).

  • Milena Mihail & Peter Winkler (1996). On the number of Eulerian orientations of a graph. Algorithmica 16(4/5), 402–414.

  • Christos H. Papadimitriou & Stathis Zachos (1982). Two remarks on the power of counting. In Proceedings of the 6th GI Conference on Theoretical Computer Science, 269–276.

  • H. Pollard & H.G. Diamond (1998). The theory of algebraic num bers. Phoenix Edition Series. Dover Publications, Inc.

  • Leslie G. Valiant (1979). The complexity of computing the perma nent. Theoretical Computer Science 8, 189–201.

  • Leslie G. Valiant (2006). Accidental algorithms. In FOCS, 509–517.

  • Leslie G. Valiant (2008). Holographic algorithms. SIAM Journal on Computing 37(5), 1565–1594.

  • Leslie G. Valiant (2010). Some observations on holographic algo rithms. In Proceedings of 9th Latin American Theoretical Informatics Symposium, Oaxaca, Mexico, 577–590. Springer-Verlag.

  • Dirk Vertigan (2005). The computational complexity of Tutte invari ants for planar graphs. SIAM Journal on Computing 35(3), 690–712.

Download references

Author information

Authors and Affiliations

  1. École polytechnique fédérale, de Lausanne, Lausanne, Switzerland

    Sangxia Huang

  2. Microsoft Research Asia, Beijing, China

    Pinyan Lu

Authors
  1. Sangxia Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pinyan Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sangxia Huang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, S., Lu, P. A Dichotomy for Real Weighted Holant Problems. comput. complex. 25, 255–304 (2016). https://doi.org/10.1007/s00037-015-0118-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-015-0118-3

Keywords

Subject classification

Search

Navigation