Holographic reduction for some counting problems

Holographic reduction is a powerful tool to divide a line between tractable cases and #P-hardness. Based on dichotomies of #CSP, Holant^@? and Holant^c problem, we succeed to give a dichotomy for some particular problems in Cai et al. (2008) [5] and Valiant (2004) [8].

[1]  Jin-Yi Cai,et al.  From Holant to #CSP and Back: Dichotomy for Holantc Problems , 2012, Algorithmica.

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

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

[4]  Jin-Yi Cai,et al.  Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

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

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

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

[8]  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.