Holant clones and the approximability of conservative holant problems
We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study of weighted counting Constraint Satisfaction Problems. We explore the landscape of conservative holant clones and deter...
| Main Authors: | , |
|---|---|
| פורמט: | Journal article |
| שפה: | English |
| יצא לאור: |
Association for Computing Machinery
2020
|