Abstract
We study the approximability of boolean Holant problems with complementarily symmetric constraint functions on cubic graphs. We identify a regime in which the problem admits an FPRAS (fully polynomial-time randomized approximation scheme) and specify conditions under which the problem is hard to approximate. This is the first attempt to classify the approximability of Holant problems with asymmetric constraint functions on cubic graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
