A complete dichotomy for complex-valued Holant^c


Holant problems are a family of counting problems on graphs, parametrised by sets of complexvalued functions of Boolean inputs. HOLANTc denotes a subfamily of those problems, where any function set considered must contain the two unary functions pinning inputs to values 0 or 1. The complexity classification of Holant problems usually takes the form of… (More)