Zero-freeness and approximation of real Boolean Holant problems
References
Index Terms
- Zero-freeness and approximation of real Boolean Holant problems
Recommendations
Computational Complexity of Holant Problems
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant problems. Compared to counting constraint satisfaction problems (#CSP), it is a refinement with a more explicit role for the constraint ...
Dichotomy for Holant∗ Problems on the Boolean Domain
AbstractHolant problems are a general framework to study counting problems. Both counting constraint satisfaction problems (#CSP) and graph homomorphisms are special cases. We prove a complexity dichotomy theorem for , where is a set of ...
A Dichotomy for Real Weighted Holant Problems
Holant is a framework of counting characterized by local constraints. It is closely related to other well-studied frameworks such as the counting constraint satisfaction problem (#CSP) and graph homomorphism. An effective dichotomy for such frameworks ...
Comments
Information & Contributors
Information
Published In
Publisher
Elsevier Science Publishers Ltd.
United Kingdom
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in