A Full Complexity Dichotomy for Complex-Valued Boolean Holant ProblemsResearch Paper
A counting problem asks for the weighted number of global configurations satisfying local constraints; a complexity dichotomy decides, for every choice of local rules, whether the problem is computable in polynomial time or #P-hard. Boolean Holant problems are the most general Boolean framework in which such classifications are pursued: they contain…