Abstract
We introduce an idea called anti-gadgets for reductions in complexity theory. These anti-gadgets are presented as graph fragments, but their effect is equivalent to erasing the presence of other graph fragments, as if we had managed to include a negative copy of a certain graph gadget. We use this idea to prove a complexity dichotomy theorem for the partition function Z(G) of spin systems over 3-regular directed graphs G, Z(G) = ∑σ : V(G) → { 0,1} ∏ (u,v) ∈ E(G) f(σ (u), σ (v)), where each edge is given a (not necessarily symmetric) complex-valued binary function f: { 0,1}2 → C. We show that Z(G) is either computable in polynomial time or #P-hard, depending explicitly on f. When the input graph G is planar, there is an additional class of polynomial time computable partition functions Z(G), while everything else remains #P-hard. Furthermore, this additional class is precisely those that can be transformed by a holographic reduction to matchgates, followed by the Fisher-Kasteleyn-Temperley algorithm via Pfaffians.
Supplemental Material
Available for Download
Supplemental movie and image files for, Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
- Miriam Backens. 2017. A new Holant dichotomy inspired by quantum computation. In 44th International Colloquium on Automata, Languages, and Programming (ICALP’17), July 10-14, 2017, Warsaw, Poland. 16:1--16:14.Google Scholar
- Miriam Backens. 2017. A new Holant dichotomy inspired by quantum computation. CoRR abs/1702.00767 (2017).Google Scholar
- Rodney J. Baxter. 1982. Exactly Solved Models in Statistical Mechanics. Academic Press London.Google Scholar
- Andrei Bulatov and Martin Grohe. 2005. The complexity of partition functions. Theor. Comput. Sci. 348, 2 (2005), 148--186. Google Scholar
Digital Library
- Andrei A. Bulatov. 2013. The complexity of the counting constraint satisfaction problem. J. ACM 60, 5 (2013), 34:1--34:41. Google Scholar
Digital Library
- Andrei A. Bulatov and Víctor Dalmau. 2007. Towards a dichotomy theorem for the counting constraint satisfaction problem. Inform. and Comput. 205, 5 (2007), 651--678. Google Scholar
Digital Library
- Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2018. Dichotomy for real Holant<sup>c</sup> problems. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18), New Orleans, LA, January 7-10, 2018. SIAM, 1802--1821. Google Scholar
Digital Library
- Jin-Yi Cai and Xi Chen. 2010. A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights. In FOCS’10. IEEE Computer Society, 437--446. Google Scholar
Digital Library
- Jin-Yi Cai, Xi Chen, and Pinyan Lu. 2016. Nonnegative weighted #CSP: An effective complexity dichotomy. SIAM J. Comput. 45, 6 (2016), 2177--2198.Google Scholar
Cross Ref
- Jin-Yi Cai, Vinay Choudhary, and Pinyan Lu. 2009. On the theory of matchgate computations. Theory Comput. Syst. 45, 1 (2009), 108--132. Google Scholar
Digital Library
- Jin-Yi Cai, Heng Guo, and Tyson Williams. 2016. A complete dichotomy rises from the capture of vanishing signatures. SIAM J. Comput. 45, 5 (2016), 1671--1728.Google Scholar
Cross Ref
- Jin-Yi Cai, Sangxia Huang, and Pinyan Lu. 2012. From Holant to #CSP and back: Dichotomy for Holant<sup>c</sup> problems. Algorithmica 64, 3 (2012), 511--533. Google Scholar
Digital Library
- Jin-Yi Cai and Michael Kowalczyk. 2012. Spin systems onk-regular graphs with complex edge functions. Theor. Comput. Sci. 461 (2012), 2--16. Google Scholar
Digital Library
- Jin-Yi Cai and Michael Kowalczyk. 2013. Partition functions on k-regular graphs with {0, 1}-vertex assignments and real edge functions. Theor. Comput. Sci. 494, 0 (2013), 63--74. Google Scholar
Digital Library
- Jin-Yi Cai, Michael Kowalczyk, and Tyson Williams. 2012. Gadgets and anti-gadgets leading to a complexity dichotomy. In Innovations in Theoretical Computer Science 2012, Cambridge, MA, January 8-10, 2012. 452--467. Google Scholar
Digital Library
- Jin-Yi Cai and Pinyan Lu. 2011. Holographic algorithms: From art to science. J. Comput. Syst. Sci. 77, 1 (2011), 41--61. Google Scholar
Digital Library
- Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2009. Holant problems and counting CSP. In STOC’09. ACM, 715--724. Google Scholar
Digital Library
- Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2011. Computational complexity of Holant problems. SIAM J. Comput. 40, 4 (2011), 1101--1132. Google Scholar
Digital Library
- Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2011. A computational proof of complexity of some restricted counting problems. Theor. Comput. Sci. 412, 23 (2011), 2468--2485. Google Scholar
Digital Library
- Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2011. Dichotomy for Holant* problems of Boolean domain. In SODA’11. SIAM, 1714--1728. Google Scholar
Digital Library
- Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2012. Holographic reduction, interpolation and hardness. Computational Complexity 21, 4 (2012), 573--604.Google Scholar
Cross Ref
- Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2014. The complexity of complex weighted Boolean #CSP. J. Comput. System Sci. 80, 1 (2014), 217--236. Google Scholar
Digital Library
- Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2017. Holographic algorithms with matchgates capture precisely tractable planar #CSP. SIAM J. Comput. 46, 3 (2017), 853--889.Google Scholar
Cross Ref
- Nadia Creignou, Sanjeev Khanna, and Madhu Sudan. 2001. Complexity Classifications of Boolean Constraint Satisfaction Problems. Society for Industrial and Applied Mathematics. Google Scholar
Digital Library
- Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum. 2009. The complexity of weighted Boolean #CSP. SIAM J. Comput. 38, 5 (2009), 1970--1986. Google Scholar
Digital Library
- Martin Dyer, Leslie Ann Goldberg, and Mike Paterson. 2007. On counting homomorphisms to directed acyclic graphs. J. ACM 54, 6 (2007). Google Scholar
Digital Library
- Martin Dyer and Catherine Greenhill. 2000. The complexity of counting graph homomorphisms. Random Struct. Algorithms 17, 3–4 (2000), 260--289. Google Scholar
Digital Library
- Martin Dyer and David Richerby. 2010. On the complexity of #CSP. In STOC’10. ACM, 725--734. Google Scholar
Digital Library
- Martin E. Dyer and David Richerby. 2013. An effective dichotomy for the counting constraint satisfaction problem. SIAM J. Comput. 42, 3 (2013), 1245--1274.Google Scholar
Cross Ref
- Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, and Marc Thurley. 2010. A complexity dichotomy for partition functions with mixed signs. SIAM J. Comput. 39, 7 (2010), 3336--3402. Google Scholar
Digital Library
- Heng Guo, Sangxia Huang, Pinyan Lu, and Mingji Xia. 2011. The complexity of weighted Boolean #CSP modulo k. In STACS’11. Schloss Dagstuhl—Leibniz-Zentrum fuer Informatik, 249--260.Google Scholar
- Heng Guo, Pinyan Lu, and Leslie G. Valiant. 2013. The complexity of symmetric Boolean parity Holant problems. SIAM J. Comput. 42, 1 (2013), 324--356.Google Scholar
Cross Ref
- Pavol Hell and Jaroslav Nešetřil. 1990. On the complexity of H-coloring. J. Comb. Theory Ser. B 48, 1 (1990), 92--110. Google Scholar
Digital Library
- Michael Kowalczyk. 2010. Dichotomy Theorems for Holant Problems. Ph.D. Dissertation. University of Wisconsin—Madison. Retrieved January 17, 2019 from http://cs.nmu.edu/∼mkowalcz/research/main.pdf. Google Scholar
Digital Library
- Michael Kowalczyk and Jin-Yi Cai. 2010. Holant problems for regular graphs with complex edge functions. In STACS. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 525--536.Google Scholar
- Michael Kowalczyk and Jin-Yi Cai. 2016. Holant problems for 3-regular graphs with complex edge functions. Theory Comput. Syst. 59, 1 (2016), 133--158. Google Scholar
Digital Library
- László Lovász. 1967. Operations with structures. Acta Math. Hung. 18, 3–4 (1967), 321--328.Google Scholar
- H. N. V. Temperley and Michael E. Fisher. 1961. Dimer problem in statistical mechanics—an exact result. Philos. Mag. 6, 68 (1961), 1061--1063.Google Scholar
Cross Ref
- Salil P. Vadhan. 2001. The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31, 2 (2001), 398--427. Google Scholar
Digital Library
- Leslie G. Valiant. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3 (1979), 410--421.Google Scholar
Digital Library
- Leslie G. Valiant. 2008. Holographic algorithms. SIAM J. Comput. 37, 5 (2008), 1565--1594. Google Scholar
Digital Library
- Mingji Xia, Peng Zhang, and Wenbo Zhao. 2007. Computational complexity of counting problems on 3-regular planar graphs. Theor. Comput. Sci. 384, 1 (2007), 111--125.Google Scholar
Cross Ref
Index Terms
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
Recommendations
Gadgets and anti-gadgets leading to a complexity dichotomy
ITCS '12: Proceedings of the 3rd Innovations in Theoretical Computer Science ConferenceWe introduce an idea called anti-gadgets in complexity reductions. These combinatorial gadgets have the effect of erasing the presence of some other graph fragment, as if we had managed to include a negative copy of a graph gadget. We use this idea to ...
Partition functions on k-regular graphs with {0,1}-vertex assignments and real edge functions
We prove a complexity dichotomy theorem for a class of partition functions over k-regular graphs, for any fixed k. These problems can be viewed as graph homomorphisms from an arbitrary k-regular input graph G to the weighted two vertex graph on {0,1} ...
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1) constraints, ...






Comments