# A Dichotomy for Real Boolean Holant Problems

We prove a complexity dichotomy for Holant problems on the boolean domain with arbitrary sets of real-valued constraint functions. These constraint functions need not be symmetric nor do we assume any auxiliary functions as in previous results. It is proved that for every set ℱ of real-valued constraint functions, Holant(ℱ) is either P-time computable or #P-hard. The classification has an explicit criterion. This is the culmination of much research on this problem, and it uses previous results and techniques from many researchers. Some particularly intriguing concrete functions f_6, f_8 and their associated families with extraordinary closure properties related to Bell states in quantum information theory play an important role in this proof.

READ FULL TEXT