Before revision:  This result contrasts with known approximation algorithms when |\lambda|\neq 1 or b\in (\frac{\Delta-2{\Delta},}  1 ), and shows that the Lee-Yang circleof zeros is computationally intractable, even on bounded-degree graphs.
After revision:  This result contrasts with known approximation algorithms when |\lambda|\neq 1 or {\Delta},} 1 ), and shows that the Lee-Yang circleof zeros is computationally intractable, even on bounded-degree graphs.