A Planar Holant Dichotomy for Symmetric Constraints∗

Total Page:16

File Type:pdf, Size:1020Kb

A Planar Holant Dichotomy for Symmetric Constraints∗ FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints∗ Jin-Yi Cai† Zhiguo Fu ‡ Heng Guo § Tyson Williams ¶ [email protected] [email protected] [email protected] [email protected] Abstract We prove a complexity classification for Holant problems defined by an arbitrary setof complex-valued symmetric constraint functions on Boolean variables. This is to specifically answer the question: Is the Fisher-Kasteleyn-Temperley (FKT) algorithm under a holographic transformation [45] a universal strategy to obtain polynomial-time algorithms for problems over planar graphs that are intractable on general graphs? There are problems that are #P-hard on general graphs but polynomial-time solvable on planar graphs. For spin systems [31] and counting constraint satisfaction problems (#CSP) [26], a recurring theme has emerged that a holographic reduction to FKT precisely captures these problems. Surprisingly, for Holant, we discover new planar tractable problems that are not expressible by a holographic reduction to FKT. In particular, a straightforward formulation of a dichotomy for planar Holant problems along the above recurring theme is false. A dichotomy theorem for #CSPd, which denotes #CSP where every variable appears a multiple of d times, has been an important tool in previous work. However the proof for the #CSPd dichotomy violates planarity, and it does not generalize to the planar case easily. In fact, due to our newly discovered tractable problems, the putative form of a planar #CSPd dichotomy is false when d ≥ 5. Nevertheless, we prove a dichotomy for planar #CSP2. In this case, the putative form of the dichotomy is true. (This is presented in Part II of the paper.) We manage to prove the planar Holant dichotomy relying only on this planar #CSP2 dichotomy, without resorting to a more general planar #CSPd dichotomy for d ≥ 3. A special case of the new polynomial-time computable problems is counting perfect match- ings (#PM) over k-uniform hypergraphs when the incidence graph is planar and k ≥ 5. The same problem is #P-hard when k = 3 or k = 4, which is also a consequence of our dichotomy. When k = 2, it becomes #PM over planar graphs and is tractable again. More generally, over hypergraphs with specified hyperedge sizes and the same planarity assumption, #PMis polynomial-time computable if the greatest common divisor (gcd) of all hyperedge sizes is at least 5. It is worth noting that it is the gcd, and not a bound on hyperedge sizes, that is the criterion for tractability. ∗A preliminary version appeared in FOCS 2015 [9]. †Department of Computer Science, University of Wisconsin–Madison. Supported by NSF CCF-1714275. ‡School of Computer Science & Information Technology, Northeast Normal University, Changchun, China. Sup- ported by National Natural Science Foundation of China (Grant No. 61872076). §School of Informatics, University of Edinburgh. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 947778). ¶Blocher Consulting. 1 Part I Planar Holant Dichotomy 1 Introduction The Fisher-Kasteleyn-Temperley (FKT) algorithm [41, 29, 30] is a classical gem that counts perfect matchings over planar graphs in polynomial time. This was an important milestone in a decades- long research program by physicists in statistical mechanics to determine what is known as Exactly Solved Models [3, 28, 39, 50, 51, 33, 41, 29, 30, 34, 35, 49]. For four decades, the FKT algorithm stood as the polynomial-time algorithm for any counting problem over planar graphs that is #P-hard over general graphs. Then Valiant introduced match- gates [43, 42] and holographic reductions to the FKT algorithm [45, 44]. These reductions differ from classical ones by introducing quantum-like superpositions. This novel technique extended the reach of the FKT algorithm and produced polynomial-time algorithms for a number of problems for which only exponential-time algorithms were previously known. Since the new polynomial-time algorithms appear so exotic and unexpected, and since they solve problems that appear so close to being #P-hard, they challenge our faith in the well-accepted conjecture that P =6 NP. Quoting Valiant [44]: “The objects enumerated are sets of polynomial systems such that the solvability of any one member would give a polynomial time algorithm for a specific problem. ::: the situation with the P = NP question is not dissimilar to that of other unresolved enumerative conjectures in mathematics. The possibility that accidental or freak objects in the enumeration exist cannot be discounted if the objects in the enumeration have not been studied systematically.” Indeed, if any “freak” object exists in this framework, it would collapse #P to P. Therefore, over the past 10 to 15 years, this technique has been intensely studied in order to gain a systematic understanding of the limit of the trio of holographic reductions, matchgates, and the FKT algorithm [42, 6, 7, 15, 46, 16, 32, 38, 37]. Without settling the P versus #P question, the best hope is to achieve a complexity classification. This program finds its sharpest expression in a complexity dichotomy theorem, which classifies every problem expressible in a framework as either solvable in P or #P-hard, with nothing in between. Out of this work, a strong theme has emerged. For a wide variety of problems, such as those expressible as a #CSP, holographic reductions to the FKT algorithm is a universal technique for turning problems that are #P-hard in general to P-time solvable over planar graphs. In fact, a preponderance of evidence suggests the following putative classification of all counting problems defined by local constraints into exactly three categories: (1) those that are P-time solvable over general graphs; (2) those that are P-time solvable over planar graphs but #P-hard over general graphs; and (3) those that remain #P-hard over planar graphs. Moreover, category (2) consists precisely of those problems that are holographically reducible to the FKT algorithm. This theme is so strong that it has become an intuitive and trusty guide for us when we investigate unknown problems and plan proof strategies. In fact, many of the results in the present paper are proved in this way. However, one is still left wondering whether the FKT algorithm is universal, or more precisely, is the combined algorithmic power of holographic reductions, matchgates, and the FKT algorithm sufficient to capture all tractable problems over planar graphs that are intractable in general? 2 We list some of the supporting evidence for this putative classification. These date back to the classification of the complexity of the Tutte polynomial [48, 47]. It has also been an unfailing theme in the classification of spin systems and #CSP[31, 19, 14, 26]. However, these frameworks do not capture all locally specified counting problems. Some natural problems, such as counting perfect matchings (#PM), are not expressible as a point on the Tutte polynomial or a #CSP, and #PM is provably not expressible within the special case of vertex assignment models [24, 23, 40]. However, this is the problem for which FKT was designed, and is the basis of Valiant’s matchgates and holographic reductions. A refined framework, called Holant problems [17], was proposed to address this issue. It is an edge assignment model. It naturally encodes and expresses #PM as well as Valiant’s matchgates and holographic reductions. Thus, Holant is the proper framework in which to study the power of holographic algorithms. It is also more general than #CSP in that any #CSP problem is a special case of a Holant problem, and a complete complexity classification for Holant problems implies one for #CSP. In this paper, we classify for the first time the complexity of Holant problems over planar graphs with an arbitrary set of symmetric complex-valued constraint functions. Our result generalizes both the dichotomy for Holant [27, 11] and the dichotomy for planar #CSP [19, 26]. Surprisingly, we discover new planar tractable problems that are not expressible by a holographic reduction to matchgates and FKT. To the best of our knowledge, this is the first primitive extension since FKT to a problem solvable in P over planar instances but #P-hard in general. We consider this extension primitive in the sense that it provably cannot be obtained by applying any holographic reduction to matchgates and FKT. Furthermore, our dichotomy theorem says that this completes the picture: there are no more undiscovered extensions for problems expressible in this framework, unless #P collapses to P. In particular, the putative form of the planar Holant dichotomy is false. Before stating our main theorem, we give a brief description of the Holant framework [17]. Fix a set of local constraint functions F.A signature grid Ω = (G; π) is a tuple, where G = (V; E) is a graph, π labels each v 2 V with a function fv 2 F with input variables from the incident edges f gdeg(v) C E(v) at v. Each fv maps 0; 1 toQ . We consider all 0-1 edge assignments. An assignment 2 j j σ for every e E gives an evaluation v2V fv(σ E(v)), where σ E(v) denotes the restriction of σ to E(v). The counting problem on the instance Ω is to compute X Y Holant(Ω; F) = fv σ jE(v) : (1.1) σ:E!f0;1g v2V For example, #PM, the problem of counting perfect matchings in G, corresponds to assigning the ExactOne function at every vertex of G. The Holant problem parameterized by the set F is denoted by Holant(F). At a high level, we can state our main theorem as follows. Theorem 1.1.
Recommended publications
  • Complexity Dichotomies of Counting Problems
    Electronic Colloquium on Computational Complexity, Report No. 93 (2011) Complexity Dichotomies of Counting Problems Pinyan Lu Microsoft Research Asia. [email protected] Abstract In order to study the complexity of counting problems, several inter- esting frameworks have been proposed, such as Constraint Satisfaction Problems (#CSP) and Graph Homomorphisms. Recently, we proposed and explored a novel alternative framework, called Holant Problems. It is a refinement with a more explicit role for constraint functions. Both graph homomorphism and #CSP can be viewed as special sub-frameworks of Holant Problems. One reason such frameworks are interesting is because the language is expressive enough so that they can express many natural counting problems, while specific enough so that it is possible to prove complete classification theorems on their complexity, which are called di- chotomy theorems. From the unified prospective of a Holant framework, we summarize various dichotomies obtained for counting problems and also proof techniques used. This survey presents material from the talk given by the author at the 4-th International Congress of Chinese Math- ematicians (ICCM 2010). 1 Introduction The complexity of counting problems is a fascinating subject. Valiant defined the class #P to capture most of these counting problems [Val79b]. Beyond the complexity of individual problems, there has been a great deal of interest in proving complexity dichotomy theorems which state that for a wide class of counting problems, every problem in the class is either computable in polynomial time (tractable) or #P-hard. One such framework is called counting Constraint Satisfaction Problems (#CSP) [CH96, BD03, DGJ07, Bul08, CLX09b, DR10b, CCL11].
    [Show full text]
  • Edinburgh Research Explorer
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Edinburgh Research Explorer Edinburgh Research Explorer A Holant Dichotomy: Is the FKT Algorithm Universal? Citation for published version: Cai, J-Y, Fu, Z, Guo, H & Williams, T 2015, A Holant Dichotomy: Is the FKT Algorithm Universal? in IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015. IEEE, pp. 1259-1276, Foundations of Computer Science 2015, Berkley, United States, 17/10/15. DOI: 10.1109/FOCS.2015.81 Digital Object Identifier (DOI): 10.1109/FOCS.2015.81 Link: Link to publication record in Edinburgh Research Explorer Document Version: Peer reviewed version Published In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015 General rights Copyright for the publications made accessible via the Edinburgh Research Explorer is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The University of Edinburgh has made every reasonable effort to ensure that Edinburgh Research Explorer content complies with UK legislation. If you believe that the public display of this file breaches copyright please contact [email protected] providing details, and we will remove access to the work immediately and investigate your claim. Download date: 05. Apr. 2019 A Holant Dichotomy: Is the FKT Algorithm Universal? Jin-Yi Cai∗ Zhiguo Fu∗y Heng Guo∗z Tyson Williams∗x [email protected] [email protected] [email protected] [email protected] Abstract We prove a complexity dichotomy for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables.
    [Show full text]
  • Matchgates Revisited
    THEORY OF COMPUTING, Volume 10 (7), 2014, pp. 167–197 www.theoryofcomputing.org RESEARCH SURVEY Matchgates Revisited Jin-Yi Cai∗ Aaron Gorenstein Received May 17, 2013; Revised December 17, 2013; Published August 12, 2014 Abstract: We study a collection of concepts and theorems that laid the foundation of matchgate computation. This includes the signature theory of planar matchgates, and the parallel theory of characters of not necessarily planar matchgates. Our aim is to present a unified and, whenever possible, simplified account of this challenging theory. Our results include: (1) A direct proof that the Matchgate Identities (MGI) are necessary and sufficient conditions for matchgate signatures. This proof is self-contained and does not go through the character theory. (2) A proof that the MGI already imply the Parity Condition. (3) A simplified construction of a crossover gadget. This is used in the proof of sufficiency of the MGI for matchgate signatures. This is also used to give a proof of equivalence between the signature theory and the character theory which permits omittable nodes. (4) A direct construction of matchgates realizing all matchgate-realizable symmetric signatures. ACM Classification: F.1.3, F.2.2, G.2.1, G.2.2 AMS Classification: 03D15, 05C70, 68R10 Key words and phrases: complexity theory, matchgates, Pfaffian orientation 1 Introduction Leslie Valiant introduced matchgates in a seminal paper [24]. In that paper he presented a way to encode computation via the Pfaffian and Pfaffian Sum, and showed that a non-trivial, though restricted, fragment of quantum computation can be simulated in classical polynomial time. Underlying this magic is a way to encode certain quantum states by a classical computation of perfect matchings, and to simulate certain ∗Supported by NSF CCF-0914969 and NSF CCF-1217549.
    [Show full text]
  • The Geometry of Dimer Models
    THE GEOMETRY OF DIMER MODELS DAVID CIMASONI Abstract. This is an expanded version of a three-hour minicourse given at the winterschool Winterbraids IV held in Dijon in February 2014. The aim of these lectures was to present some aspects of the dimer model to a geometri- cally minded audience. We spoke neither of braids nor of knots, but tried to show how several geometrical tools that we know and love (e.g. (co)homology, spin structures, real algebraic curves) can be applied to very natural problems in combinatorics and statistical physics. These lecture notes do not contain any new results, but give a (relatively original) account of the works of Kaste- leyn [14], Cimasoni-Reshetikhin [4] and Kenyon-Okounkov-Sheffield [16]. Contents Foreword 1 1. Introduction 1 2. Dimers and Pfaffians 2 3. Kasteleyn’s theorem 4 4. Homology, quadratic forms and spin structures 7 5. The partition function for general graphs 8 6. Special Harnack curves 11 7. Bipartite graphs on the torus 12 References 15 Foreword These lecture notes were originally not intended to be published, and the lectures were definitely not prepared with this aim in mind. In particular, I would like to arXiv:1409.4631v2 [math-ph] 2 Nov 2015 stress the fact that they do not contain any new results, but only an exposition of well-known results in the field. Also, I do not claim this treatement of the geometry of dimer models to be complete in any way. The reader should rather take these notes as a personal account by the author of some selected chapters where the words geometry and dimer models are not completely irrelevant, chapters chosen and organized in order for the resulting story to be almost self-contained, to have a natural beginning, and a happy ending.
    [Show full text]
  • National and Kapodistrian University of Athens Complexity Dichotomies
    National and Kapodistrian University of Athens Department of Mathematics Graduate Program in Logic and Theory of Algorithms and Computation Complexity Dichotomies for Approximations of Counting Problems Master Thesis of Andreas-Nikolas G¨obel Supervisor: Stathis Zachos Professor July 2012 2 Η παρούσα Διπλωματική Εργασία εκπονήθηκε στα πλαίσια των σπουδών για την απόκτηση του Μεταπτυχιακού Διπλώματος Ειδίκευσης στη Λογική και Θεωρία Αλγορίθμων και Υπολογισμού που απονέμει το Τμήμα Μαθηματικών του Εθνικού και Καποδιστριακού Πανεπιστημίου Αθηνών Εγκρίθηκε την 23η Ιουλίου 2012 από Εξεταστική Επιτροπή αποτελούμενη από τους: Ονοματεπώνυμο Βαθμίδα Υπογραφή 1. : Ε. Ζάχος Καθηγητής …………………… 2. : Αρ. Παγουρτζής Επίκ. Καθηγητής …………………… 3. : Δ. Φωτάκης Λέκτορας …………………… i Abstract This thesis is a survey of dichotomy theorems for computational problems, focusing in counting problems. A dichotomy theorem in computational complexity, is a complete classification of the members of a class of problems, in computationally easy and compu- tationally hard, with the set of problems of intermediate complexity being empty. Due to Ladner's theorem we cannot find a dichotomy theorem for the whole classes NP and #P, however there are large subclasses of NP (#P), that model many "natural" problems, for which dichotomy theorems exist. We continue with the decision version of constraint satisfaction problems (CSP), a class of problems in NP. for which Ladner's theorem doesn't apply. We obtain a dichotomy theorem for some special cases of CSP. We then focus on counting problems presenting the following frameworks: graph homomorphisms, counting constraint satisfaction (#CSP) and Holant problems; we provide the known dichotomies for these frameworks. In the last and main chapter of this thesis we relax the requirement of exact com- putation, and settle in approximating the problems.
    [Show full text]
  • A5730107.Pdf
    International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) Applications of Bipartite Graph in diverse fields including cloud computing 1Arunkumar B R, 2Komala R Prof. and Head, Dept. of MCA, BMSIT, Bengaluru-560064 and Ph.D. Research supervisor, VTU RRC, Belagavi Asst. Professor, Dept. of MCA, Sir MVIT, Bengaluru and Ph.D. Research Scholar,VTU RRC, Belagavi ABSTRACT: Graph theory finds its enormous applications in various diverse fields. Its applications are evolving as it is perfect natural model and able to solve the problems in a unique way.Several disciplines even though speak about graph theory that is only in wider context. This paper pinpoints the applications of Bipartite graph in diverse field with a more points stressed on cloud computing. KEY WORDS: Graph theory, Bipartite graph cloud computing, perfect matching applications I. INTRODUCTION Graph theory has emerged as most approachable for all most problems in any field. In recent years, graph theory has emerged as one of the most sociable and fruitful methods for analyzing chemical reaction networks (CRNs). Graph theory can deal with models for which other techniques fail, for example, models where there is incomplete information about the parameters or that are of high dimension. Models with such issues are common in CRN theory [16]. Graph theory can find its applications in all most all disciplines of science, engineering, technology and including medical fields. Both in the view point of theory and practical bipartite graphs are perhaps the most basic of entities in graph theory. Until now, several graph theory structures including Bipartite graph have been considered only as a special class in some wider context in the discipline such as chemistry and computer science [1].
    [Show full text]
  • Enumeration Problems on Lattices
    Enumeration Problems on Lattices by Evans Doe Ocansey Thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Mathematics in the Faculty of Science at Stellenbosch University Department of Mathematics, University of Stellenbosch, Private Bag X1, Matieland 7602, South Africa. Supervisor: Prof. Stephan Wagner December 2012 Stellenbosch University http://scholar.sun.ac.za Declaration By submitting this thesis electronically, I declare that the entirety of the work contained therein is my own, original work, that I am the sole author thereof (save to the extent explicitly otherwise stated), that reproduction and publication thereof by Stellenbosch University will not infringe any third party rights and that I have not previously in its entirety or in part submitted it for obtaining any qualification. Signature: . Evans Doe Ocansey 2012/12/20 Date: . Copyright © 2012 Stellenbosch University All rights reserved. i Stellenbosch University http://scholar.sun.ac.za Abstract Enumeration Problems on Lattices Evans Doe Ocansey Department of Mathematics, University of Stellenbosch, Private Bag X1, Matieland 7602, South Africa. Thesis: MSc (Mathematics) December 2012 The main objective of our study is enumerating spanning trees τ(G) and perfect match- ings PM(G) on graphs G and lattices L. We demonstrate two methods of enumerating spanning trees of any connected graph, namely the matrix-tree theorem and as a special value of the Tutte polynomial T (G; x; y). We present a general method for counting spanning trees on lattices in d ≥ 2 dimen- sions. In particular we apply this method on the following regular lattices with d = 2: rectangular, triangular, honeycomb, kagomé, diced, 9 · 3 lattice and its dual lattice to derive a explicit formulas for the number of spanning trees of these lattices of finite sizes.
    [Show full text]
  • Some Observations on Holographic Algorithms
    SOME OBSERVATIONS ON HOLOGRAPHIC ALGORITHMS Leslie G. Valiant August 1, 2017 Abstract. We define the notion of diversity for families of finite func- tions, and express the limitations of a simple class of holographic algo- rithms, called elementary algorithms, in terms of limitations on diver- sity. We show that this class of elementary algorithms is too weak to solve the Boolean Circuit Value problem, or Boolean Satisfiability, or the Permanent. The lower bound argument is a natural but apparently novel combination of counting and algebraic dependence arguments that is viable in the holographic framework. We go on to describe polynomial time holographic algorithms that go beyond the elementarity restriction in the two respects that they use exponential size fields, and multiple oracle calls in the form of polynomial interpolation. These new algo- rithms, which use bases of three components, compute the parity of the following quantities for degree three planar undirected graphs: the number of 3-colorings up to permutation of colors, the number of con- nected vertex covers, and the number of induced forests or feedback vertex sets. In each case the parity can also be computed for any one slice of the problem, in particular for colorings where the first color is used a certain number of times, or where the connected vertex cover, feedback set or induced forest has a certain number of nodes. Keywords. computational complexity, algebraic complexity, holo- graphic algorithms Subject classification. 03D15, 15A15, 68Q15, 68Q17, 68R10 1. Introduction The theory of holographic algorithms is based on a notion of re- duction that enables computational problems to be interrelated 2 Leslie G.
    [Show full text]
  • Mapping the Complexity of Counting Problems
    Mapping the complexity of counting problems Heng Guo Queen Mary, University of London [email protected] 1 Computational Counting The study of computational counting was initiated by Leslie Valiant in the late 70s. In the seminal papers [32, 33], he defined the computational complexity class #P, the counting counterpart of NP, and showed that the counting version of tractable decision problems can be #P-complete. One such example is counting perfect matchings (#PM). These work revealed some fundamental differences between counting problems and decision problems and stimulated a lot of research in the directions of both structural complexity theory and algorithmic design. One of the crowning results in the first direction is Toda’s theorem [31], stating that #P contains the whole polynomial hierarchy, and in the second direction we have witnessed the success of Markov chain Monte Carlo algorithms [24, 23]. A typical counting problem is #Sat, which asks the number of satisfying as- signments of a given CNF formula. An equivalent way to recast this problem is to give each assignment weight 1 if it satisfies the formula, or 0 otherwise. Then the goal is to compute the sum of all weights. Moreover, this weight can be de- composed into a product of weights of all clauses. Thus we are interested in a sum-of-product quantity (e.g. see Eq. (1) in Section 2), which is usually called the partition function. In fact, the partition function has received immense attention by statistical physicists long before computer scientists. It is a central quantity from which one can deduce various properties of a field or a system.
    [Show full text]
  • Holographic Algorithms
    Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI 53706. USA. Email: [email protected] Abstract Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algorithms for the same problems. The methodology uses Pfaffians and (planar) perfect matchings as basic computational primitives, and attempts to create exponential cancellations in computation. In this article we survey this new theory of matchgate computations and holographic algorithms. Key words: Theoretical Computer Science, Computational Complexity Theory, Perfect Match- ings, Pfaffians, Matchgates, Matchcircuits, Matchgrids, Signatures, Holographic Algorithms. 1 Some Historical Background There have always been two major strands of mathematical thought since antiquity and across civilizations: Structural Theory and Computation, as exemplified by Euclid’s Elements and Dio- phantus’ Arithmetica. Structural Theory prizes the formulation and proof of structural theorems, while Computation seeks efficient algorithmic methods to solve problems. Of course, these strands of mathematical thought are not in opposition to each other, but rather they are highly intertwined and mutually complementary. For example, from Euclid’s Elements we learn the Euclidean algo- rithm to find the greatest common divisor of two positive integers. This algorithm can serve as the first logical step in the structural derivation of elementary number theory. At the same time, the correctness and efficiency of this and similar algorithms demand proofs in a purely structural sense, and use quite a bit more structural results from number theory [4]. As another example, the computational difficulty of recognizing primes and the related (but separate) problem of in- teger factorization already fascinated Gauss, and are closely tied to the structural theory of the distribution of primes [21, 1, 2].
    [Show full text]
  • On the Complexity of Holant Problems
    On the Complexity of Holant Problems Heng Guo1 and Pinyan Lu2 1 School of Mathematical Sciences, Queen Mary University of London, London, UK [email protected] 2 Institute for Theoretical Computer Science, School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, China [email protected] Abstract In this article we survey recent developments on the complexity of Holant problems. We discuss three different aspects of Holant problems: the decision version, exact counting, and approximate counting. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, G.2.1 Com- binatorics. Keywords and phrases Computational complexity, Counting complexity, Dichotomy theorems, Approximate counting, Holant problems Digital Object Identifier 10.4230/DFU.Vol7.15301.159 1 Introduction Ladner’s theorem [53] states that if P 6= NP then there is an infinite hierarchy of intermediate problems that are not polynomial time interreducible. For certain restrictions of these classes, however, dichotomy theorems can be achieved. For NP a dichotomy theorem would state that any problem in the restricted subclass of NP is either in P or NP-complete (or both, in the eventuality that NP equals P.) The restrictions for which dichotomy theorems are known can be framed in terms of local constraints, most importantly, Constraint Satisfaction Problems (CSP) [58, 28, 4, 5, 6, 33, 38, 27, 37], and Graph Homomorphism Problems [34, 42, 8]. Explicit dichotomy results, where available, manifest a total understanding of the class of computation in question, within polynomial time reduction, and modulo the collapse of the class. In this article we survey dichotomies in a framework for characterizing local properties that is more general than those mentioned in the previous paragraph, namely the so-called Holant framework [18, 19].
    [Show full text]
  • American Scientist the Magazine of Sigma Xi, the Scientific Research Society
    A reprint from American Scientist the magazine of Sigma Xi, The Scientific Research Society This reprint is provided for personal and noncommercial use. For any other use, please send a request Brian Hayes by electronic mail to [email protected]. Computing Science Accidental Algorithms Brian Hayes hy are some computational also refers to them as “accidental algo- Wproblems so hard and others A strange new family rithms,” emphasizing their capricious, easy? This may sound like a childish, rabbit-from-the-hat quality; they seem whining question, to be dismissed with to pluck answers from a tangle of un- a shrug or a wisecrack, but if you dress of algorithms probes likely coincidences and cancellations. it up in the fancy jargon of computation- I am reminded of the famous Sidney al complexity theory, it becomes quite the boundary Harris cartoon in which a long series a serious and grownup question: Is P of equations on a blackboard hinges on equal to NP? An answer—­accompanied between easy the notation “Then a miracle occurs.” by a proof—­will get you a million bucks from the Clay Mathematics Institute. and hard problems The Coffee-Break Criterion I’ll return in a moment to P and NP, For most of us, the boundary between but first an example, which offers a fast and slow computations is clearly glimpse of the mystery lurking beneath exactly once? This problem was posed marked: A computation is slow if it’s the surface of hard and easy problems. in 1858 by William Rowan Hamilton, not finished when you come back Consider a mathematical graph, a col- and the path is called a Hamiltonian from a coffee break.
    [Show full text]