Holographic Algorithms (Extended Abstract)

We introduce a new notion of efficient reduction among computational problems. Classical reductions involve gadgets that map local solutions of one problem to local solutions of another in one-to-one, or possibly many-to-one or one-to-many, fashion. Our proposed reductions allow for gadgets with many-to-many correspondences. Their objective is to preserve the sum of the local solutions. Such reductions provide a method of translating a combinatorial problem to a family of finite systems of polynomial equations with integer coefficients such that the number of solutions of the combinatorial problem can be counted in polynomial time if some system in the family has a solution over the complex numbers. We can derive polynomial time algorithms in this way for ten problems for which only exponential time algorithms were known before. General questions about complexity classes are also formulated. If the method is applied to a #P-complete problem then we obtain families of polynomial systems such that the solvability of any one member would imply P/sup #P/ = NC2.

[1]  P. W. Kasteleyn.  The Statistics of Dimers on a Lattice , 1961 .

[2]  M. Fisher.  Statistical Mechanics of Dimers on a Plane Lattice , 1961 .

[3]  M. Fisher,et al.  Dimer problem in statistical mechanics-an exact result , 1961 .

[4]  E. Lieb.  Exact Solution of the F Model of An Antiferroelectric , 1967 .

[5]  E. Lieb.  Exact Solution of the Problem of the Entropy of Two-Dimensional Ice , 1967 .

[6]  Elliott H. Lleb.  Residual Entropy of Square Ice , 1967 .

[7]  E. Lieb.  Exact Solution of the Two-Dimensional Slater KDP Model of a Ferroelectric , 1967 .

[8]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[9]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[10]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[11]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[12]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[13]  D. Rose,et al.  Generalized nested dissection , 1977 .

[14]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Narsingh Deo,et al.  Node-Deletion NP-Complete Problems , 1979, SIAM J. Comput..

[17]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[18]  Leslie G. Valiant,et al.  Negation can be exponentially powerful , 1979, Theor. Comput. Sci..

[19]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[20]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[21]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[22]  Mark Jerrum,et al.  Some Exact Complexity Results for Straight-Line Computations over Semirings , 1982, JACM.

[23]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[24]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[25]  M. Jerrum.  Two-dimensional monomer-dimer systems are computationally intractable , 1987 .

[26]  M. Jerrum.  Two-dimensional monomer-dimer systems are computationally intractable , 1987 .

[27]  Éva Tardos,et al.  The gap between monotone and non-monotone circuit complexity is exponential , 1988, Comb..

[28]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[29]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[30]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[31]  L. Valiant.  Why is Boolean complexity theory difficult , 1992 .

[32]  Dominic J. A. Welsh,et al.  The Computational Complexity of the Tutte Plane: the Bipartite Case , 1992, Combinatorics, Probability and Computing.

[33]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[34]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[35]  Wayne Goddard,et al.  Defective coloring revisited , 1997, J. Graph Theory.

[36]  Harry B. Hunt,et al.  The Complexity of Planar Counting Problems , 1998, SIAM J. Comput..

[37]  Meena Mahajan,et al.  Determinant: Old Algorithms, New Insights , 1998, SIAM J. Discret. Math..

[38]  Peter Bürgisser,et al.  Completeness and Reduction in Algebraic Complexity Theory , 2000, Algorithms and computation in mathematics.

[39]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..

[40]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[41]  Leslie G. Valiant.  Expressiveness of matchgates , 2002, Theor. Comput. Sci..

[42]  Leslie G. Valiant,et al.  Quantum Circuits That Can Be Simulated Classically in Polynomial Time , 2002, SIAM J. Comput..

[43]  Maciej Liskiewicz,et al.  The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes , 2003, Theor. Comput. Sci..

[44]  Régis Barbanchon,et al.  On unique graph 3-colorability and parsimonious reductions in the plane , 2004, Theor. Comput. Sci..

[45]  Jin-Yi Cai,et al.  Valiant's Holant Theorem and matchgate tensors , 2007, Theor. Comput. Sci..

[46]  Leslie G. Valiant,et al.  Completeness for Parity Problems , 2005, COCOON.

[47]  Leslie G. Valiant,et al.  Holographic Circuits , 2005, ICALP.

[48]  Jin-Yi Cai,et al.  Some Results on Matchgates and Holographic Algorithms , 2007, Int. J. Softw. Informatics.

[49]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .