Holant problems and counting CSP

We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant Problems. Compared to counting Constrained Satisfaction Problems (CSP), it is a refinement with a more explicit role for the function constraints. Both graph homomorphism and CSP can be viewed as special cases of Holant Problems. We prove complexity dichotomy theorems in this framework. Because the framework is more stringent, previous dichotomy theorems for CSP problems no longer apply. Indeed, we discover surprising tractable subclasses of counting problems, which could not have been easily specified in the CSP framework. The main technical tool we use and develop is holographic reductions. Another technical tool used in combination with holographic reductions is polynomial interpolations. The study of Holant Problems led us to discover and prove a complexity dichotomy theorem for the most general form of Boolean CSP where every constraint function takes values in the complex number field {C}.

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

[2]  Martin E. Dyer,et al.  The Complexity of Weighted Boolean #CSP , 2009, SIAM J. Comput..

[3]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[4]  P. Dienes,et al.  On tensor geometry , 1926 .

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

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

[7]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[8]  Martin E. Dyer,et al.  Corrigendum: The complexity of counting graph homomorphisms , 2004, Random Struct. Algorithms.

[9]  Jin-Yi Cai,et al.  Holographic algorithms: from art to science , 2007, STOC '07.

[10]  Jin-Yi Cai,et al.  Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

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

[12]  Leslie G. Valiant,et al.  Holographic Algorithms (Extended Abstract) , 2004, FOCS.

[13]  Martin E. Dyer,et al.  The complexity of counting graph homomorphisms (extended abstract) , 2000, SODA '00.

[14]  Michael Luby,et al.  Approximating the Permanent of Graphs with Large Factors , 1992, Theor. Comput. Sci..

[15]  Andrei A. Bulatov,et al.  The complexity of partition functions , 2005, Theor. Comput. Sci..

[16]  Jin-Yi Cai,et al.  Graph Homomorphisms with Complex Values: A Dichotomy Theorem , 2009, SIAM J. Comput..

[17]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[18]  Leslie Ann Goldberg,et al.  A Complexity Dichotomy for Partition Functions with Mixed Signs , 2008, SIAM J. Comput..

[19]  Martin E. Dyer,et al.  On counting homomorphisms to directed acyclic graphs , 2006, JACM.

[20]  Jin-Yi Cai,et al.  On Symmetric Signatures in Holographic Algorithms , 2009, Theory of Computing Systems.

[21]  L. Lovasz,et al.  Reflection positivity, rank connectivity, and homomorphism of graphs , 2004, math/0404468.

[22]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[23]  Peng Zhang,et al.  Computational complexity of counting problems on 3-regular planar graphs , 2007, Theor. Comput. Sci..

[24]  Andrei A. Bulatov,et al.  Towards a dichotomy theorem for the counting constraint satisfaction problem , 2007, Inf. Comput..