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]. (C) 2011 Elsevier B.V. All rights reserved.
holographic reduction dichotomy computational complexity #p