Highly Influenced

# Dichotomy for Real Holant$^c$ Problems

@inproceedings{Cai2017DichotomyFR, title={Dichotomy for Real Holant\$^c\$ Problems}, author={Jin-Yi Cai and Pinyan Lu and Mingji Xia}, year={2017} }

- Published 2017

Holant problems capture a class of Sum-of-Product computations such as counting matchings. It is inspired by holographic algorithms and is equivalent to tensor networks, with counting CSP being a special case. A classification for Holant problems is more difficult to prove, not only because it implies a classification for counting CSP, but also due to the deeper reason that there exist more intricate polynomial time tractable problems in the broader framework. We discover a new family of… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

1 Citations

26 References

Similar Papers